471 views

1 Answer

0 votes
0 votes

For construction of unique binary tree we should have either inorder and postorder or inorder and preorder and in this question only inorder is given so multiple binary tree are possible ,some of them given below

edited by

Related questions

0 votes
0 votes
0 answers
1
Na462 asked Jan 16, 2019
388 views
Consider a binary tree for every node | P - Q | <= 2. P represents number of nodes in left subtree of S and Q represents number of nodes in right subtree of S for h 0. T...
0 votes
0 votes
0 answers
2
0 votes
0 votes
0 answers
3
Soumya29 asked Oct 22, 2018
305 views
I know the answer. But is there any general FORMULA for it?If yes, please provide the complete derivation of it. In the solution, they used $\rightarrow 2^{h-1}+1.$ I tri...
0 votes
0 votes
0 answers
4
Na462 asked Oct 20, 2018
620 views
Consider 4 labeled 1,2,3,4. The number of distinct binary tree possible such that whose inorder traversal is 1,2,3,4 are ........