Smatchcube's website 🌍

Exercise 3.26

My table implementation uses the binary tree implementation of Chapter 2.

Constructors, selectors and mutators for binary trees:

Each record of tables is stored in a node of the tree.

The same-key? predicate tests if the first key match the second key and the key-before? predicate compares two keys and tells if the first key should be to the left of the second key in the tree.