The height of a binary tree is defined as the maximum number

Report

Report an issue

Name

Email

Message

Submit

Cancel

PGCET CSE Exam (Karnataka) 2011 click here to view all questions

The height of a binary tree is defined as the maximum number of edges in any path from the root to the leaf. The maximum number of nodes in any binary tree of height h is

A2^h

B2^h-1-1

C2^h+1

D2^h+1-1

Akilesh Kharvi ? Dec 8 '2016 at 21:59

Answer: \(2^{h+1}-1\)

Explanation:

The number  of nodes in a binary tree of height h is at least h + 1, 
and at most \(2^{h+1}-1\) here h is the depth of the tree.

reference: http://en.wikipedia.org/wiki/Binary_tree#Properties_of_binary_trees

All DiscussionsClick here to write answer

Answer: \(2^{h+1}-1\) Explanation: The number of nodes in a binary tree of height h is at least h + 1, and at most \(2^{h+1}-1\) here h is the depth of the tree. reference: http://en.wikipedia.org/wiki/Binary_tree#Properties_of_binary_trees Akilesh Kharvi ? answered Dec 8 '2016 at 21:59 All Comments

Post your answers here:

Post

Post your comments here:

Message

Post

Cancel