- Courses
- Tutorials
- Interview Prep
Data Structures | Binary Trees | Question 11
Last Updated :
Discuss
Comments
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:
2^h -1
2^(h-1) – 1
2^(h+1) -1
2*(h+1)
This question is part of this quiz :
Top MCQs on Binary Trees Data Structure with Answers,JavaScript TreesShare your thoughts in the comments
GeeksforGeeks