550 views

1 Answer

Best answer
6 votes
6 votes
For a binary tree with n nodes,

Maximum height (when the tree is left-skewed or right-skewed) = n - 1 = 1056 - 1 =1055

Minimum height (for a complete binary tree) = $\left \lceil log_{2}(n + 1) \right \rceil$  - 1 = 11 - 1 = 10
selected by

Related questions

1 votes
1 votes
0 answers
2
Nandkishor3939 asked Jan 25, 2019
631 views
I think its answer is 8 .Please ,can any one make it sure for me :)
0 votes
0 votes
1 answer
3
Prince Sindhiya asked Jan 2, 2019
701 views
A full binary tree is a tree in which every node other than the leaves has two children. If there are 600 leaves then total number of leaf nodes are?
2 votes
2 votes
3 answers
4