PROGRAMMING:JMU DS binary tree for expression solving

Binary tree is used to represent the expression, and each node of the tree includes an operator and an operand. The algebraic expression contains only '+', '-', '*', '/', '(', ') and one integer without error. According to the rule of brackets, multiplication and division, and then addition and subtraction, the binary tree is constructed. As shown in the figure, the "1 + (2 + 3) * 2-4 / 5" algebraic expression corresponds to a binary tree, and the corresponding binary tree is used to calculate the value of the expression.
###Input format:
Enter a line of expression string with only one operator in parentheses.
###Output format:
Output the calculation result of the expression. If the divisor is 0, prompt 'divide 0 error`
###Input sample 1:
```in
(1+2)*3-4/5+(3-2)
```
###Output sample 1:
```out
nine point two
```
###Input sample 2:
```
1+2*3-4
```
###Output sample 2:
```
three
```






answer：If there is no answer, please comment