previous | index | next

Inserting Into Binary Search Trees

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


         (insert 3
           (insert 1
             (insert 6
               (insert 2
                 (insert 4 (make-empty-tree))))))
previous | index | next