Write a Python program that will generate 10 random positive integers and insert them into the binary search tree one at a time. Then using one of the traversals (pre-order, post-order, or in-order) show the contents of the list. In your video use a diagram to show what the tree would look like with your given data, also explain the traversal you chose to display the data. (optional bonus question) Extend the buildParseTree function to handle mathematical expressions that do not have spaces between every character.
(optional bonus question) Extend the buildParseTree and evaluate functions to handle boolean statements. Remember that "not" is a unary operator, so this will complicate your code somewhat.