Q.

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
D. T Q O S P R
Answer» C. T Q O P S R
2k
0
Do you find this helpful?
15

View all MCQs in

Data Structures (DS)

Discussion

No comments yet