Which of the following statement is incorrect with respect to evaluation...

Home / Data Structure / Stacks In Data Structures / Question

Examveda

Which of the following statement is incorrect with respect to evaluation of infix expression algorithm?

A. Operand is pushed on to the stack

B. If the precedence of operator is higher, pop two operands and evaluate

C. If the precedence of operator is lower, pop two operands and evaluate

D. The result is pushed on to the operand stack

Answer: Option B

Related Questions on Stacks in Data Structures

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)

View Answer

A. Push

B. Pop

C. Peek

D. Size

View Answer

A. Last In First Out

B. Last In Last Out

C. First In First Out

D. First In Last Out

View Answer

A. By using a singly linked list

B. By using a doubly linked list

C. By using a circular linked list

D. All of the above

View Answer