Computer Science · Data Structures
Let T be a binary tree of height 'h'. What is the maximum number of leaf (external) nodes and internal nodes that can exist in T?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 12h-2 and 2h - 1
- 22h+1 and 2h - 1
- 32h-1 and 2h - 1
- 42h and 2h - 1✓
Correct answer
2h and 2h - 1
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Data Structures MCQs →Want more practice questions on Data Structures?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures