How would design a system that represet multiplication and sum operation between two operands? Note that you need to support parthesis
Anonimo
one option is to do string parsing. but he was actually looking for binary tree solution where each node can be either the operation or the operand. this way the root node would be the operation and its left and right nodes will be the operand. how would solve this operands binary tree either recursively and iteratively