Mathematics · Data Structures & Discrete Math
In a perfect binary tree with 511 nodes (height = 8, having 256 leaves), what is the minimum number of nodes that must be removed to have no more than 100 leaf nodes remaining?
- 1205
- 2307✓
- 3206
- 4308
Correct answer
307
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!
Preparing for Mathematics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Data Structures & Discrete Math?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Data Structures & Discrete Math