Hardcode a Binary Search Tree and write Inorder Traversal, Max, Min, and Successor functions. Hook up the functions to visualizer.