Gate CS-2007 Question Paper With Solutions

Q. 1 The height of a binary tree is the maximum number of edges in any root to leaf

path. The maximum number of nodes is a binary tree of height h is

(A) 2h−1

(B) 2h−1 -1

(C) 2h+1-1

(D) 2h+1

Answer: (C)

Explanation:

Learn More:   Gate ME 2014-3 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here