Q.

Which of the following data structure is required to convert arithmetic expression in infix to its equivalent postfix notation?

A. Queue
B. Linked list
C. Binary search tree
D. None of above
Answer» D. None of above
2.9k
0
Do you find this helpful?
1

View all MCQs in

Data Structures (DS)

Discussion

No comments yet