Vidyalelo
Data Structure · Q50

Trees in Data Structures

Programming · Data Structure · question 50

Q50

In an expression tree algorithm, what happens when an operand is encountered?

A.
create one node pointing to a stack
Answer
B.
pop the nodes from the stack
C.
clear stack
D.
merge all the nodes

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board