Data Structure
Java
Python
HTML
Interview Preparation
- Tutorials
- Courses
- Tracks
ISRO | CS | 2016 | Algorithms | Complexity Analysis | Question 27
Last Updated :
Discuss
Comments
A complete binary tree with n non-leaf nodes contains
log2 n nodes
n+1 nodes
2n nodes
2n+1 nodes
This question is part of this quiz :
Top MCQs on Binary Trees Data Structure with Answers,ISRO CS 2016Share your thoughts in the comments
GeeksforGeeks