BST cont. #

Running time is O(n). Space complexity best case is O(lgn). Space complexity worst case is O(n).