Teaching HPSC Lecturer (Technical) Mock Test 2024 Programming and Data Structure Binary Heap Binary Search Tree
If for a given Binary Search Tree (BST) the pre-order traversal is 41, 23, 11, 31, 62, 50, 73. Then which of the following is its post-order traversal?
1
11, 31, 23, 50, 73, 62, 41
2
31, 11, 23, 50, 41, 62, 73
3
11, 31, 50, 23, 73, 62, 41
4
11, 31, 23, 50, 62, 73, 41
5
Question Not Attempted