BANK SEBI Grade A Phase 1 & Phase 2 Mock Test 2024 Programming and Data Structure Tree Tree Traversal
Let post order traversal of a binary search tree (BST) is given by VSQTURP. If S < V < Q < P < T < R < U, then the pre-order traversal of the BST is:
1
SVQPTRU
2
PQSVRTU
3
SVRUTQP
4
PRQSUTV
5
PQSVTRU