Nodes in the tree are are either tuples of the form
{Key,Value,S,B} or the atom nil. S are trees with
keys smaller than Key and B are trees with keys bigger
or equal to Key.
Lists are written as in Prolog - as examples the
familiar append and member functions are written: