Representing lists as Binary Trees

(previously represented trees as lists)

A list is either

• [  ]  empty

or

• non-empty, having a

first      <-- not necessarily a list

   and a

rest       <-- always a list