Computer Science, asked by Ahujariya4808, 1 year ago

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)

Answers

Answered by Anonymous
0
C) Dn = log (n+1).....✔️✔️✔️
Similar questions