Multiple choice technology architecture

The depth of a complete binary tree is given by

  1. Dn = n log2n

  2. Dn = n log2n+1

  3. Dn = log2n

  4. Dn = log2n+1
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

The depth of a complete binary tree is the number of levels from root to deepest leaf. For n nodes, the depth equals ⌊log₂n⌋ + 1 because a tree of depth d can hold at most 2^d - 1 nodes. This logarithmic relationship reflects how nodes double at each level in a perfect binary tree.

Keep practicing — related questions