Vidyalelo
Data Structure · Q40

Trees in Data Structures

Programming · Data Structure · question 40

Q40

What is the height of a complete binary tree with n nodes where n is a power of 2?

A.
log2(n)
Answer
B.
log2(n) - 1
C.
2*log2(n)
D.
log2(n) + 1

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board