Expression Tree Multiple choice Questions and Answers (MCQs)
Click on any option to know the CORRECT ANSWERS
What is the postfix expression for the following expression tree?
Question 11 Explanation:
If the given expression tree is evaluated, the postfix expression ab+cde+** is obtained.
In an expression tree algorithm, what happens when an operand is encountered?
create one node pointing to a stack
pop the nodes from the stack
merge all the nodes
Question 12 Explanation:
When an operand is encountered, create one node trees and push it on to the stack. When an operator is encountered, pop the pointers from last two trees from the stack.
There are 12 questions to complete.