Problem

1. Extend the build_parse_tree function to handle mathematical expressions that do not have spaces between every character.

2. Modify the build_parse_tree and evaluate functions to handle boolean statements (and, or, and not). Remember that "not" is a unary operator, so this will complicate your code somewhat.

3. Using the find_successor method, write a non-recursive inorder traversal for a binary search tree.