A

Admin • 802.91K Points
Coach

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

  • (A) Dn = n log2n.
  • (B) Dn = n log2n+1.
  • (C) Dn = log2n.
  • (D) Dn = log2n+1.

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.