| 149 | } |
| 150 | |
| 151 | int compute(EXT tree) { |
| 152 | if(tree == NULL) |
| 153 | return 0; |
| 154 | |
| 155 | if(tree->left == NULL && tree->right == NULL) |
| 156 | return ((int)tree->data) - 48; |
| 157 | |
| 158 | int left = compute(tree->left); |
| 159 | int right = compute(tree->right); |
| 160 | |
| 161 | if(tree->data == '+') |
| 162 | return left + right; |
| 163 | if(tree->data == '-') |
| 164 | return left - right; |
| 165 | if(tree->data == '*') |
| 166 | return left * right; |
| 167 | if(tree->data == '/') |
| 168 | return left / right; |
| 169 | |
| 170 | return -1; |
| 171 | } |
| 172 | |
| 173 |