393 views
1 votes
1 votes
For a binary tree T with n vertices with n vertices,show tat the minimum possible height is logbase2(n+1)-1.Plz give the mathematical proof for it.

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
2
0 votes
0 votes
2 answers
3
iita asked Jan 24, 2017
780 views
A 5-ary tree is a tree in which every internal node has 3 children.The number of leaf nodes in such a tree with 10 internal nodes is______