K

Kartik Sharma • 7.98K Points
Tutor III Computer

Q. The depth of a complete binary tree is given by

  • (A) Dn = log 2 (n+1)
  • (B) Dn = log 1/2 (n+1)
  • (C) Dn = log (n+1)
  • (D) Dn = log 2 (n-1)
  • Correct Answer - Option(A)
  • Views: 243
  • Filed under category Computer
Explanation by: Kartik Sharma
A complete binary tree is a binary tree where all the levels have maximum number of nodes except possibly the last level.

The depth of complete binary tree of n nodes will be Dn=log 2 (n+1) where Dn is the height or depth of the tree and n is the number of nodes.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Question analytics