a binary tree generates the sequence abcdefg for an inorder transversal andthe sequence acbgfed for a postorder transversal.what are the total number of nodes in the left subtree of this binary tree?
Answers
Answered by
0
Answer:
Write an efficient algorithm to construct a binary tree from given inorder and preorder sequence. Root will be the first element in preorder sequence i.e. 1. ... Next we locate the index of the root node in inorder sequence.
Explanation:
Similar questions