In an expression tree algorithm, what happens when an operand is encountered?
In an expression tree algorithm, what happens when an operand is encountered? Correct Answer create one node pointing to a stack
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.
মোঃ আরিফুল ইসলাম
Feb 20, 2025