ISRO CS-2023
August 29, 2024ISRO CS-2023
August 29, 2024ISRO CS-2023
|
Question 42
|
The preorder traversal of a binary search tree is (10, 5, 1, 7, 40, 50). The postorder traversal is
|
(1, 5, 7, 10, 40, 50)
|
|
|
(50, 40, 10, 7, 5, 1)
|
|
|
(1,7, 5, 10, 40, 50)
|
|
|
(1, 5, 7, 50, 40, 10)
|
Correct Answer: B