stunnakid2324 stunnakid2324 09-01-2024 Mathematics contestada 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. SVQPTRUB. PQSVRTUC. SVRUTQPD. PRQSUTVE. PQSVTRU