816 views

1 Answer

0 0 votes

Max no. of nodes in a complete n-ary tree is : n^k+1 - 1 / n - 1

where n is max no. of nodes tree can have

k is the height of the tree(take height of leaf as 0)

 

Position:
Show:

Related questions

4 4 votes
5 5 answers
9.3k
9.3k views
sripo asked Jan 16, 2019
9,312 views
Let us there are n nodes which are labelled.Then the number of trees possible is given by the Catalan Number i.e $\binom{2n}{n} / (n+1)$Then the binary search trees possi...
0 0 votes
0 0 answers
1.4k
1.4k views
1 1 vote
2 answers 2 answers
1.8k
1.8k views