Vidyalelo
Data Structure · Q221

Binary Search Trees(B Tree)

Programming · Data Structure · question 221

Q221

The post-order traversal of a binary tree is O P Q R S T. Then possible pre-order traversal will be . . . . . . . .

A.
T Q R S O P
B.
T O Q R P S
C.
T Q O P S R
Answer
D.
T Q O S P R

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board