Register

Balanced tree Minimum no of nodes for height h

• recategorized by
1,135 views
4 votes
4 votes

• recategorized by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

5 votes
5 votes
5 answers
2
Tushar Shinde asked Jan 19, 2016
14,151 views
Number of nodes in heap of height 'h'
The number of nodes of height $h$ in any $n$-element heap is ________. $h$ $2^{h}$ ceil $\left[\frac{n}{2^{h}}\right]$ ceil $\left[\frac{n}{2^{h+1}}\right]$ Answer is given as D, But I think it should be C. Because, even if you take height=1 then possible nodes are 3 and 2.
The number of nodes of height $h$ in any $n$-element heap is ________.$h$$2^{h}$ceil $\left[\frac{n}{2^{h}}\right]$ceil $\left[\frac{n}{2^{h+1}}\right]$Answer is given as...
User Avatar
2 votes
2 votes
1 answer
3
vijaycs asked May 25, 2016
12,827 views
Minimum number of nodes in a full binary tree with height 3?
User Avatar
0 votes
0 votes
1 answer
4
radha gogia asked Apr 7, 2016
567 views
How to find the number of height balanced nodes in a tree in O(n) time ?
A node is height balanced if difference between height of left subtree and right subtree is either -1 , 0 or 1 , so how to count such nodes , without maintaining any extra field in the node except for left and right child pointers .
A node is height balanced if difference between height of left subtree and right subtree is either -1 , 0 or 1 , so how to count such nodes , without maintaining any extr...
User Avatar
Link Copied!