0 0 votes formule for 1.number of binary tree 2.number of binary search tree 3.number labeled binary tree 4.number of unlabeled binary tree Programming in C + – amit166 391 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
0 0 votes 1 Number of Binary trees with n unlabeled nodes is C(2n,n) / (n+1) 2.Number of Binary trees with n labeled nodes is ( n! * C(2n,n) ) / (n+1). 3.Number of Binary search trees with n keys is C(2n,n) / (n+1) screddy1313 answered Jan 27, 2019 screddy1313 comment Share Follow 0 reply Please log in or register to add a comment.