The post-order traversal of a binary tree is O P Q R S T. Then possible pre-order traversal will be

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Data Structure (DS)

Q. The post-order traversal of a binary tree is O P Q R S T. Then possible pre-order traversal will be

(A) T Q R S O P
(B) T O Q R P S
(C) T Q O P S R
(D) T Q O S P R

💬 Discuss

✅ Correct Answer: (C) T Q O P S R

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

542

Total Visits

📽️

2 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

81%

Success Rate