8 8 votes Q.Consider a four labeled 1, 2, 3, 4. The number of distinct binary tree are possible such that whose inorder traversal is 1, 2, 3, 4 are _________ Answer must be 14 right ? Programming in C tree-traversal binary-tree + – junaid ahmad 1.4k views answer comment Share Follow Print See all 3 Comments 3 3 Comments reply pawan kumarln commented Dec 19, 2017 reply Follow flag yes 14 if one order(ie pre order / post order / in order) asked then u can use formula as # BST 5 5 replyShare Bhushan Laware commented Jan 24, 2018 reply Follow flag ans is definitely 14. 0 0 replyShare vinay chauhan commented Jan 23, 2019 reply Follow flag This is a made easy question and they have given the answer as 14*4!, they are just confusing people in the last days of GATE preparation, this question is in a full-length test, pathetic. Corrupting knowledge of others. 1 1 replyShare Please log in or register to add a comment.
3 3 votes No. of Binary Trees possible with given Order(Inorder, Preorder, or Postorder) is given by $\binom{2n}{n}/(n+1)$ So Yes Answer is 14 Ravi Raja answered Jan 14, 2018 Ravi Raja comment Share Follow 0 reply Please log in or register to add a comment.
