A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Data Structure (DS)

Q. A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?

(A) 7, 8, 26, 13, 75, 40, 70, 35
(B) 26, 13, 7, 8, 70, 75, 40, 35
(C) 7, 8, 13, 26, 35, 40, 70, 75
(D) 8, 7, 26, 13, 40, 75, 70, 35

💬 Discuss

✅ Correct Answer: (D) 8, 7, 26, 13, 40, 75, 70, 35

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

194

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

82%

Success Rate

Mr. Dubey

💬 Discussion

Related MCQs

📊 Question Analytics