A binary tree with 2k vertices of level k has at least _______ vertices.

M

Mr. Dubey

🎓 Coach ⭐ 104.48K Points

📊 Discrete Mathematics

Q. A binary tree with 2k vertices of level k has at least _______ vertices.

(A) 2 power k
(B) 2 power (k-1)
(C) 2 power (k-1)-1)
(D) 2 power (k+1)-1

💬 Discuss

✅ Correct Answer: (D) 2 power (k+1)-1

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

307

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

82%

Success Rate