COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
What data structure is used when converting an infix notation to prefix notation?
|
|
Stack
|
|
|
Queue
|
|
|
B-Trees
|
|
|
Linked-list
|
Explanation:
Detailed explanation-1: -What data structure is used when converting an infix notation to prefix notation? Explanation: First you reverse the given equation and carry out the algorithm of infix to postfix expression. Here, the data structure used is stacks.
Detailed explanation-2: -Answer: Stack Stack is used to convert infix to postfix Infix to prefix Prefix to postfix.
Detailed explanation-3: -Which data structure is needed to convert infix notation to postfix notation? Explanation: The Stack data structure is used to convert infix expression to postfix expression. The purpose of stack is to reverse the order of the operators in the expression.
There is 1 question to complete.