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.

Ancestors (11)

  1. 2
  2. Functional programming, design and analysis of algorithms (resit)
  3. 2022
  4. Past exam of the year 1 of the computer science course of the University of Oxford
  5. Year 1 of the computer science course of the University of Oxford
  6. Computer science course of the University of Oxford
  7. Undergraduate course of the University of Oxford
  8. Course of the University of Oxford
  9. University of Oxford
  10. List of universities
  11. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version