previous | index | next

Inserting Into Binary Search Trees

Then we could build any BST by inserting into an originally empty tree: 






                 (insert 4 (make-empty-tree))
previous | index | next