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
0
C) Dn = log (n+1).....✔️✔️✔️
Similar questions
Math,
6 months ago
Math,
6 months ago
Math,
6 months ago
Political Science,
1 year ago
Political Science,
1 year ago
Math,
1 year ago
Math,
1 year ago