In strictly binary tree, the out-degree of every node is either o or 2.

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Data Structure and Algorithms (DSA)

Q. In strictly binary tree, the out-degree of every node is either o or 2.

(A) true, false
(B) false, true
(C) true, true
(D) false, false

💬 Discuss

✅ Correct Answer: (C) true, true

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

50

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

80%

Success Rate