Get Started
1323

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

  • 1
    Dn = log 2 (n+1)
  • 2
    Dn = log 1/2 (n+1)
  • 3
    Dn = log (n+1)
  • 4
    Dn = log 2 (n-1)
  • Show Answer
  • Workspace

Answer : 1. "Dn = log 2 (n+1)"
Explanation :

Answer: A) Dn = log 2 (n+1) Explanation: 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.

Previous Next
IIT JEE Bank Exams Computer Questions

The Most Comprehensive Exam Preparation Platform

Get the Examsbook Prep App Today