Data Structures · Question 7 · Medium
What is the postfix form of the infix expression A + B * C - D ?
- A B + C * D -
- A B C + * D -
- A B C * + D -
- A B C D - * +
Answer and explanation
Answer: C. A B C * + D -
Explanation: * has higher precedence, so the expression is (A + (B * C)) - D. Converting gives A B C * +, then D - is applied: A B C * + D -.
Previous: An inorder traversal of a Binary Search Tree (BST) lists the keys in which… · Next: A binary tree has height 4, where height is the number of edges on the longest…
Practise data structures
Try a fresh set of data structures questions with an explanation after every answer, free and without signing up: Data Structures practice. Or sit a full placement mock test.
More data structures questions
- What is the time complexity of accessing the element at index i of an array?
- Which data structure is used to implement Breadth-First Search (BFS) of a graph?
- An inorder traversal of a Binary Search Tree (BST) lists the keys in which…
- A binary tree has height 4, where height is the number of edges on the longest…
- What is the value of the postfix expression 6 2 3 + - 3 8 2 / + * ?
- A circular queue is implemented in an array of size n using front and rear…
- Keys 15, 22, 8 and 29 are inserted in that order into an empty hash table of…
- The preorder traversal of a Binary Search Tree is 50, 30, 20, 40, 70, 60, 80…
- The keys 10, 4, 7, 1 are inserted in that order into an empty array-based…
- How many structurally different binary trees can be formed with exactly 3 nodes?
More technical & programming practice
Algorithms · Object-Oriented Programming · DBMS · SQL · Operating Systems · Computer Networks · Software Engineering · Cloud & DevOps
LogicWiz Exams home · All practice topics · Placement mock tests · Daily 10 challenge