Data Structures

Singly linked list: a sequence of nodes (little rectangular boxes) that contain some data and connect to one another, creating a chain-like structure of boxes. Connections do only in one direction.

Singly linked list. Taken from Bell, John T. "Operating-System Structures." University of Illinois, Chicago.

Doubly linked list: similar to a singly linked list (check the alt text for the previous diagram) but this time the connection from box to box goes in two directions: forwards and backwards. That is, every two adjacent boxes, say A and B, have two links: A to B, and B to A.

Doubly linked list. Taken from Bell, John T. "Operating-System Structures." University of Illinois, Chicago.

Circularly linked list: similar to a singly linked list (check the alt text for the singly linked list diagram), but there one more link in this structure: a link from the last (rightmost) box back to the very first (leftmost) box, thereby creating a cycle of boxes!

Circularly linked list. Taken from Bell, John T. "Operating-System Structures." University of Illinois, Chicago.

These notes by Miriam Briskman are licensed under CC BY-NC 4.0 and based on sources.