the question’s input order is not clear please explain what the question wants and input format properly
Create tree using preorder and inorder
you are given the preorder traversal of the tree and then inorder traversal of tree with help of this you have to make actual tree.thenprint tree in foloowing way:
for every node print its left child(if do not have left child print END) then give forward arrow=>.
then print root->data.
then print backward arrow (<=) and print its right child(if do not have right child print END).