Request New Subject
Home
Data Structures (DS)
Non Linear Data Structures - Trees
Q. The post-order traversal of a binary tree is O P Q R S T. Then possible pre-order traversal will be (Solved)
1. T Q R S O P
2. T O Q R P S
3. T Q O P S R
4. T Q O S P R
c. T Q O P S R
Related Topics
→ Linear Data Structures -Stacks and Queues
→ Non Linear Data Structures - Graphs
→ Searching, Sorting and Hashing Techniques
Subscribe Now
Get All Updates & News
Subscribe