In the previous chapter we considered linear linked lists. They are linear in their structure in the sense that list elements must be processed in a sequential manner from first to last. This is because the linked lists that we have seen have a head node which is directly accessible and each node contains an information part together with a link part that allow to move to its successor node, if it exists.

But in some cases, it may be convenient to use different kinds of accesses. In fact, other kinds of links between the nodes may also be helpful. In this chapter we consider some of these variants of linked lists such as linked stacks, linked queues, lists with fixed head, circular linked list, and so on.

9.1 LINKED ...

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

O’Reilly members experience live online training, plus books, videos, and digital content from nearly 200 publishers.