A linked list is a more general data structure. In fact we have already seen two instances of a linked list without even realising. Both the queue and the stack have been implemented using linked lists. Or more importantly are variations of a linked list. There are two types of linked list; single link and double link. We have already seen one example of each.

For the exam you are expected to know how a linked list works and also how it can be turned into a stack and a queue. A linked list is simply a collection of nodes linked together.

A doubly linked list will simply have arrows going in both directions.

The above diagram also shows a start node. When you are asked to draw a linked list you should always add a start node. It will also say if they want a singly linked or a doubly linked list.