By the end of this project, you will have defined a stack class, a binary search tree…

By the end of this project, you will have defined a stack class, a binary search tree (more information below), and a
simple compiler that takes as input a postfix program and not only compiles it, but also evaluates it and prints the output!.
You will use file I/O to read programs from files and evaluate them using your “SimpleCompiler”. If you’re unfamiliar
with postfix notation, the following programs (and their more familiar infix versions) are shown below: