CompleteGATE Doubts Forum
0 like 0 dislike
626 views
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) 2^h - 1

B) 2^(h-1) - 1

C) 2^(h+1) - 1

D) 2^(h+1)
asked Jun 19, 2016 in Data Structures by CompleteGATE-AskUS (3,550 points) | 626 views

1 Answer

0 like 0 dislike

C) 2(h+1) - 1

answered Jun 19, 2016 by ebeisaac (13,250 points)
Welcome to Completegate AskUs, A place where you can ask questions regarding videos located at Youtube Channel and receive answers from our experts.

Sign up for our newsletter to receive the latest news and event postings.

Best Users 10/2019
  1. CompleteGATE-AskUS

    3550 Points

  2. Asma Abbasi

    200 Points

  3. Henry

    150 Points

  4. SilverChat

    140 Points

Rewards per month
First Winner: 0 INR (Not Started)
Second Winner: 0 INR (Not Started)

×

Like us on Facebook

Show your Support. Become a FAN!

107 questions
100 answers
2 comments
74 users