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