GATE | GATE-CS-2007 | Question 12
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a binary tree of height h is:
(B) 2h−1 -1
Explanation: See Question 1 https://www.geeksforgeeks.org/data-structures-and-algorithms-set-10/
Quiz of this Question
Level Up Your GATE Prep!
Embark on a transformative journey towards GATE success by choosing Data Science & AI
as your second paper choice with our specialized course. If you find yourself lost in the vast landscape of the GATE syllabus, our program is the compass you need.