Binary Search Tree
Information
Nodes can be added into the Binary search tree, once added, these nodes are then organized into their respective positions. Left for smaller than the root nodes and right for those that are larger. A feature is included into the code that allows the user to see all the nodes currently in the binary search tree, as well as their respective parent node. A delete node function is present in the program as well, the user will type the node value he wishes to delete, which the process will match the input value and delete the node of that matching value. Other options given to the user is seeing the largest/smallest node in the tree as well as clearing the screen to help with screen clutter.
Code
Below is the link to the code on in a Google Document
​