The Gateway to Computer Science Excellence
0 votes
26 views
formule for

1.number of binary tree

2.number of binary search tree

3.number labeled binary tree

4.number of unlabeled binary tree
in Programming by Junior (745 points) | 26 views

1 Answer

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)

by (481 points)

Related questions

0 votes
1 answer
1
asked Dec 20, 2018 in Graph Theory by Sumita Bose (139 points) | 42 views
+3 votes
1 answer
2
asked Oct 17, 2017 in DS by Abhijeet_Kumar Junior (625 points) | 38 views
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,650 questions
56,192 answers
193,988 comments
94,863 users