The height of a binary tree is the number of edges in the longest path from…
2026
The height of a binary tree is the number of edges in the longest path from the root to a leaf in the tree. The maximum possible height of a full binary tree with 23 nodes is _________. (answer in integer)
Attempted by 33 students.
Show answer & explanation
Correct answer: 11
In a full binary tree, every node has either:
0 children, or
2 children.
For a full binary tree:Number of nodes=2i+1
where iii = number of internal nodes.
Given:
n=23n = 23n=23
To get the maximum height, we make the tree as skewed as possible while still remaining full.
In a full binary tree with maximum height:
each internal node contributes one extra level,
and one subtree continues the chain while the other is a leaf.
Number of internal nodes:
