Discussion
The minimum number of nodes possible in a binary tree of height h (assuming that the root is at height 1) is :
Answer: A
The minimum number of nodes is h.
A binary tree of height h has the fewest nodes when it is a single chain, each node having exactly one child. With the root at height 1, that chain has one node per level, h nodes in all.
\(2^{h} - 1\) is the maximum number of nodes (a full binary tree), \(2^{h-1}\) is the most nodes possible on the last level, and \(2^{h}\) is not a bound for this counting at all.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development