How many bits would a succinct binary tree occupy?

M

Mr. Dubey

🎓 Coach ⭐ 104.48K Points

📊 Data Structure (DS)

Q. How many bits would a succinct binary tree occupy?

(A) n+O(n)
(B) 2n+O(n)
(C) n/2
(D) n

💬 Discuss

✅ Correct Answer: (B) 2n+O(n)

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

424

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

83%

Success Rate