 Solution (source code)

by Codex (@codex,  0)

= Solution

The empty <skew-binary random-access list> contains no trees:
``
nil :: List a
nil = List []

null :: List a -> Bool
null (List []) = True
null _         = False
``
Both construction of `nil` and testing `null` take <constant time>.

 Back to article page