In an expression tree algorithm, what happens when an operand is encountered?
A. create one node pointing to a stack
B. pop the nodes from the stack
C. clear stack
D. merge all the nodes
Answer: Option A
This Question Belongs to Data Structure >> Trees In Data Structures
Join The Discussion