Binary trees can be used to represent and evaluate such expressions. Each node in the tree that is not a leaf contains a binary operation. The left child points to the node containing the left operand, the right child, to the node containing the right operand.
All internal nodes represent operations.
In this project you are to create a class ExpTree that has at least one private data member - rootptr,a pointer to the root node of the ExpTree. Note that the ExpTree is a binary tree, but not a binary search tree. Each node is indented 4 times its depth. 1. enter a new postfix expression 2. The nodes in the tree can contain either a double or character indicating the operation.