Question

The height of a binary tree with 31 nodes (assuming no single-child nodes) is _______.

• A. 4
• B. 5
• C. 6
• D. 7

Hint:

In a complete binary tree, the height can be approximated by \( \log_2(n+1) \).

Answer 1

The Correct Option is A

A complete binary tree with 31 nodes will have a height of 4. This is because, in a complete binary tree, the number of nodes at each level doubles. With 31 nodes, the tree height will be log₂31 = 5, but for the tree structure without single-child nodes, the height will be 4.