engineering recuitment NIC NIELIT Scientist B 2023 Mock Test Programming and Data Structure Tree Tree Traversal
The post order traversal of a binary search tree is given by 25, 30, 20, 45, 60, 50, 40, 35. The pre order traversal of this tree will be given by:
1
20, 25, 30, 35, 40, 45, 50, 60
2
35, 30, 20, 25, 40, 50, 45, 60
3
25, 35, 30, 40, 20, 50, 60, 45
4
35, 20, 30, 25, 40, 50, 45, 60