In mathematics, a list can be defined recursively. A list (a,b,c) can be expressed as (a,(b,c)), which can be expressed as (a,(b,(c))), and then (a,(b,(c,()))).
In module 0043, we have already discussed this recursive nature of a list. We also discussed a common interface to access a list. In this module, we’ll explore how to perform more interesting operations based on the primitives of the list ADT.