Tuesday, 28 August 2012

The depth of a complete binary tree is given by | Data Structures

A. Dn = n log2n
B. Dn = n log2n+1
C. Dn = log2n
D. Dn = log2n+1

Ans:  D


No comments: