Request New Subject
Home
Data Structures (DS)
Linear Data Structures -Stacks and Queues
Q. Which data structure is needed to convert infix notation to postfix notation? (Solved)
1. Branch
2. Tree
3. Queue
4. Stack
d. Stack
Related Topics
→ Non Linear Data Structures - Graphs
→ Non Linear Data Structures - Trees
→ Searching, Sorting and Hashing Techniques
Subscribe Now
Get All Updates & News
Subscribe