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
Attention reader! Don’t stop learning now. Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.
Learn all GATE CS concepts with Free Live Classes on our youtube channel.