98 98 votes In a binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most $2$. If the height of the tree is $h > 0$, then the minimum number of nodes in the tree is $2^{h-1}$ $2^{h-1} + 1$ $2^h - 1$ $2^h$ Data Structures gateit-2005 data-structures binary-tree normal + – Ishrat Jahan 38.1k views answer comment Share Follow Print See all 6 Comments 6 6 Comments reply Show 3 previous comments js__ commented Jan 31 reply Follow flag @Arjun @Shaik Masthan i solve such ques by taking examples , cannot derive the relations quickly or cannot recall formulas in some cases, what to do 0 0 replyShare Shaik Masthan commented Jan 31 reply Follow flag @js__, in exams you need to solve them using examples only. Never try derivation in the exams. 4 4 replyShare js__ commented Jan 31 reply Follow flag 🙏 0 0 replyShare Please log in or register to add a comment.
0 0 votes Y ninjahatori1 answered Jul 28, 2025 ninjahatori1 comment Share Follow See 1 comment 1 1 comment reply ninjahatori1 commented Jul 28, 2025 reply Follow flag h = 1 should be there at second last line 0 0 replyShare Please log in or register to add a comment.
–3 –3 votes Wrong options jyotish4017 answered Jan 21, 2018 • reshown Jan 22, 2018 by jyotish4017 jyotish4017 comment Share Follow See all 5 Comments 5 5 Comments reply Show 2 previous comments RasMalai commented Aug 4, 2020 reply Follow flag I had the same doubt but then I read the question again after reading your comment. Thanks @AnkitaSingh001 0 0 replyShare neel19 commented Jan 30, 2021 reply Follow flag Made the same mistake 0 0 replyShare comder_ASHU commented Feb 4, 2024 reply Follow flag Yeah , I too had same doubt . But reading question carefully it says no. Of node and I was taking height difference 🥲 0 0 replyShare Please log in or register to add a comment.
