237 views

1 Answer

0 votes
0 votes

Answer : Cannot be determined

Following can be the cases:

1)If Pre-order and Inorder is given  ---> Unique Binary Tree

2)If Post-order and Inorder is given ----- > Unique Binary Tree

3)If Pre-order,Post Order and Inorder is given ----> Unique Binary Tree

4) if Pre-Order and Post-Order given ----- > More than one binary trees

5) if either Pre-Order or Post Order is given   ------>  2nCn/(n+1) binary trees are possible

Related questions

2 votes
2 votes
1 answer
1
Abhijeet_Kumar asked Oct 17, 2017
243 views
0 votes
0 votes
1 answer
2
krish asked Aug 21, 2016
420 views
what is te diffrence b/w hight, depth, level in binary tree and can i say level= height+1 if yes then prove it
0 votes
0 votes
1 answer
3
iarnav asked Jun 19, 2018
704 views
Let's say we're given with a MAX Heap and we want to delete any of the leaf node, then how much time will it take to delete any of the leaf node and maintain the max heap...
0 votes
0 votes
1 answer
4
Shubham Aggarwal asked Aug 29, 2018
369 views