Write a function to evaluate an expression tree t represented using the template structure BinaryTreeNode. Assume that each node has a field value that your procedure can use. The value field for nodes representing constants and variables contains the appropriate numeric value. For this project assume the permisible operators are binary +, -, *, / and no delimiters needed. If you want to include as many operators and some delimiters that is welcome. Use the function to develop a class Expression as a derived class of BinaryTree. The class should permit the operation Evaluate the expression tree. Due Last day of class before the lecture You may give it to me before the last day of class. I will need about 5 minutes with you to test the program. THE CODE CANNOT BE COMPLEX OR MY PROFESSOR WILL NOT BELIEVE IT IS MINE
## Deliverables
Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Complete copyrights to all work purchased.
## Platform
windows 98 and visual c++ THE CODE CANNOT BE COMPLEX OR MY PROFESSOR WILL NOT BELIEVE IT IS MINE