Freaks City

A Binary Search Tree (BST) is defined as either an empty tree or a tree satisfying these conditions: for any node, all values in its left subtree are less than its own value, and all values in its right subtree are greater. Both subtrees must also be BSTs. Given a sequence of unique integers, insert them sequentially into an initial empty BST. ...