Nodes that are not root and not leaf are called as internal nodes.

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Data Structure and Algorithms (DSA)

Q. Nodes that are not root and not leaf are called as internal nodes.

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

💬 Discuss

✅ Correct Answer: (C) false, true

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

336

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

85%

Success Rate