0 votes 0 votes 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 ........ Programming in C data-structures binary-tree binary-search-tree + – Na462 asked Oct 20, 2018 Na462 618 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Magma commented Oct 20, 2018 reply Follow Share it's $\binom{2n}{n}$ / (n+1) = 14 right ?? 0 votes 0 votes Shaik Masthan commented Oct 20, 2018 reply Follow Share @Magma yes, in each pattern we post the nodes as one way which give the inorder result as 1,2,3,4 1 votes 1 votes Shaik Masthan commented Oct 20, 2018 reply Follow Share this link may help https://gateoverflow.in/230861/tree-ds 0 votes 0 votes Magma commented Oct 20, 2018 reply Follow Share hmm thanks Shaik Masthan 0 votes 0 votes Na462 commented Oct 21, 2018 reply Follow Share Thats the thing i also did C(2n,n)/(n+1) but in made easy they have also multiplied by n! extra. BST are by default labelled tree right i dont know why they multiplied by n! there. 0 votes 0 votes Lakshman Bhaiya commented Oct 28, 2018 reply Follow Share If he did not strict to get in order $1,2,3,4$ then we can assign $4$ number in any order and get $4!$ combination,but in this question, it is not possible. 0 votes 0 votes Please log in or register to add a comment.
