This program reads an aritimetic expression in the prefix form and stores it as
binary tree. Using the binary tree and the traverseTree method it display the
expression in prefix, infix, and postfix notation.
ICS211, Assignment 5, Problem 2
Source text "A5p2.java"