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:
A. SVQPTRU
B. PQSVRTU
C. SVRUTQP
D. PRQSUTV
E. PQSVTRU