The depth of a complete binary tree is given by
A. Dn = log 2 (n+1)
B. Dn = log 1/2 (n+1)
C. Dn = log (n+1)
D. Dn = log 2 (n-1)
Answer:A
The depth of a complete binary tree is given by
A. Dn = log 2 (n+1) B. Dn = log 1/2 (n+1) C. Dn = log (n+1) D. Dn = log 2 (n-1)