Representing Lists by Ordered Trees
lThis
is a kind of converse to previous discussion.
lEvery
list can be represented as an ordered binary
tree (tree in which each node has at most two targets).
lThis
corresponds to a ÒboxÓ storage abstraction,
where the data items may themselves be
lists.