Yes you end up short one operator, so you have nodes containing 1000 and 160 with no operator to join them.yakin said:
So 1000 and 160 is the answer. And did I draw the Binary Tree right?DavidCampen said:
yakin said:
A postfix expression is a mathematical expression in which the operators are placed after the operands. For example, the expression "3 + 4" in infix notation would be written as "3 4 +" in postfix notation.
To evaluate a postfix expression, you start from the left and read the expression one token at a time. If the token is a number, push it onto a stack. If the token is an operator, pop the top two numbers from the stack, perform the operation, and push the result back onto the stack. Repeat this process until there are no more tokens left. The final result will be the value of the postfix expression.
Some common operators used in postfix expressions include addition (+), subtraction (-), multiplication (*), division (/), and exponentiation (^). Other operators such as parentheses and modulus (%) may also be used.
Yes, there are a few advantages to using postfix notation. One advantage is that it eliminates the need for parentheses, making expressions easier to read and evaluate. Additionally, postfix notation is easier to implement in computer programs as it follows a simple rule-based algorithm.
Yes, postfix expressions can be converted back to infix notation using a process called infix to postfix conversion. This involves reversing the steps for evaluating a postfix expression and using a stack to keep track of the operands and operators. However, the resulting infix expression may not be the same as the original one due to the elimination of parentheses.
