I would like to add a method get_predecessor() and get_successor() to the BinarySearchTree class implementation.
These are common algorithms performed on Binary Search Trees and will return the next lowest/next highest value from the tree based on a given BST and a given value.