Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

GATE | GATE-CS-2007 | Question 12

  • Last Updated : 28 Jun, 2021

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:
(A) 2h−1
(B) 2h−1 -1
(C) 2h+1-1
(D) 2h+1


Answer: (C)

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.

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!