Home » General Knowledge » Computer

The depth of a complete binary tree is given by

Correct Answer: 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 Question Next Question→

Discussion & Comments

No comments yet. Be the first to comment!
Join Discussion