What is the height of a complete binary tree with n...

Home / Data Structure / Trees In Data Structures / Question

Examveda

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

A. log2(n)

B. log2(n) - 1

C. 2*log2(n)

D. log2(n) + 1

Answer: Option A

Related Questions on Trees in Data Structures

A. 2

B. 3

C. 4

D. Any number

View Answer

A. Root

B. Leaf

C. Parent

D. Sibling

View Answer

A. Inorder

B. Preorder

C. Postorder

D. Level-order

View Answer

A. n-1

B. n

C. 2n-1

D. 2n

View Answer