In Chapter 6, stacks and queues were considered. As a data structure they are a sequence of data elements where only two types of operations can be performed: insertion and deletion. Moreover, these operations are restricted to the ends of stacks and queues which are nothing but special types of lists. But in the case of a general list, there is no restriction. An element can be inserted into or deleted from any position of the existing list. In fact, a general list may require some more operations on it. Lists, in general, together with different types of list implementations are discussed in this chapter in detail.


In general, we use the term ‘list’ to signify a series of elements. It is to be noted here that ...

Get Data Structures Using C now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.