☰
GkSeries.com
✕

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]

⭐ Make GKSeries Your Preferred Source on Google

Add GKSeries as Preferred Source
Click Here to Read more questions