Question

10. Which of the following data structure is required to converí arithmetic
expression in infix to its equivalent postfix notation?
a neuc
b) Linked list
e) Binary scarcli trec
d) Nore oť above​

Answer 1

Answer:

answer is not linked list ... Answer is none of the above

Answer 2

The correct answer is option (b) Linked list.

Explanation:

• Linked list data structure is required to converí arithmetic expression in infix to its equivalent postfix notation.
• In computer science, a linked list is a linear collection of data elements whose order is not given by their physical placement in memory.
• Instead, each element points to the next. It is a data structure consisting of a collection of nodes which together represent a sequence.
• It is a non primitive type of data structure in which each element is dynamically allocated and in which elements point to each other to define a linear relationship.
• Elements of linked list are called nodes where each node contains two things, data and pointer to next node.