| 3 | #include"BST.h" |
| 4 | |
| 5 | int main() { |
| 6 | EXT tree; |
| 7 | char data[100]; |
| 8 | |
| 9 | printf("\n Enter the input Expression : "); |
| 10 | scanf("%s", data); |
| 11 | |
| 12 | initTree(&tree, data, strlen(data)); |
| 13 | |
| 14 | printf("\n Expression Tree Traversal is : "); |
| 15 | traverse(tree); |
| 16 | |
| 17 | printf("\n Computed Result is : %d", compute(tree)); |
| 18 | |
| 19 | return 0; |
| 20 | } |
| 21 |