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

💬 Discuss

✅ Correct Answer: (D) Dn = log2n+1

Published by Mr. Dubey ⭐ 111.42K Points at 13-Sep-2023 11:13 am in Data Structure and Algorithms (DSA)

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

383

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

90%

Success Rate