2 votes 2 votes NUMBER OF BINARY TREE POSSIBLE WITH 3 UNLABELED NODES? DS data-structures binary-tree + – iarnav asked Jan 7, 2018 iarnav 399 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Ashwin Kulkarni commented Jan 7, 2018 reply Follow Share $5$ $\frac{^{2n}C_n}{n+1} = \frac{^6C_3}{4} = 5$ 0 votes 0 votes iarnav commented Jan 8, 2018 reply Follow Share Ashwin Kulkarni i think these are 5 structures 0 votes 0 votes akash.dinkar12 commented Jan 8, 2018 reply Follow Share @iarnav Yes, these are 5 structures and if u will ask for a number of labelled nodes then u have to multiply with 3! then in this case number of trees - 3! *5 =30. 0 votes 0 votes smsubham commented Feb 17, 2018 reply Follow Share Useful Read: https://gatecse.in/number-of-binary-trees-possible-with-n-nodes/ https://www.geeksforgeeks.org/enumeration-of-binary-trees/ 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes No. of binary trees possible with 'n' unlabelled nodes is :- C(2n, n)/(n+1) so answer will be :- C(2*3, 3)/4 = 5 sanny_1 answered May 26, 2018 sanny_1 comment Share Follow See all 0 reply Please log in or register to add a comment.
