GkSeries.com

Q.

The depth of a complete binary tree is given by

[A] Dn = n log2n
[B] Dn = n log2n+1
[C] Dn = log2n
[D] Dn = log2n+1
Answer & Explanation
Option: [D]

DOWNLOAD CURRENT AFFAIRS PDF FROM APP

Please share this page

Click Here to Read more questions

Teacher Eligibility Test