The height of a tree is the length of the longest path from root to leaf. What is the maximum and minimum number of nodes in a binary tree of height 'n'?
Show answerHide answer
Correct answer: (A) 2ⁿ⁺¹ − 1, n + 1
Explanation
A binary tree of height n has at most 1 + 2 + ... + 2ⁿ = 2ⁿ⁺¹ − 1 nodes (completely full) and at least n + 1 nodes (one node per level, a chain).