Binary Search Tree (BST)

Left < node < right ordering invariant supporting search, insert, predecessor/successor, and Hibbard delete.

This lesson has not been built yet.