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


Correct Option: D

Find more quizzes: