open navigation menu
AiFolder
Tools for a smarter you
Discover
Tools
AI
Games
Interviews
Blog
More
Search AiFolder
Toggle theme
Toggle theme
Sign in
Exit
00:00
Submit test
Stacks · Intermediate
8 questions · Question 1 of 8
13%
Multiple Choice
Mid
Explain what are Infix, Prefix and Postfix Expressions?
A
Problem For example I have a string 2 (1+(2 1)); How to convert this into a binary expression tree?
B
A Stack is a container of objects that are inserted and removed according to the last in first out (LIFO) principle.
C
Infix expression notation requires that the operators appear between them in the expression A + B A + B C Prefix expression notation requires that all operators precede the two operands that they work on.
D
If you have an ADT Queue with only push front() and pop back() as its interface, there is no way to use it as a stack.
Previous
Next