LIST PROCESSING.

The article reports that lists are very flexible data structures that are suitable for a large number of applications. The main advantage of lists is that they organize computer memory into an elastic object that can be allocated on demand in various amounts and shapes during the running of a program. Lists can be lengthened by the insertion of new elements or by adjoining a new list to a given list. Also, one list could be embedded inside another list, creating a two-dimensional list. Embedding can be performed repeatedly, producing structures of unrestricted depth. Thus, lists can grow both in length and depth by nesting.