A linked list is a structure with nodes linked together. Each node
holds
onto data.
Links are simply regular "variables" that hold another node (e.g. the next node or previous node).
Linked List Schematic
This sketch just gives us a conceptual idea of what a linked list looks like.
Do not worry about details yet.
Simplified
We'll be hiding the backward links in many cases just to simplify the diagrams (it is symmetric).
We'll remember the backward links are implied.
Non-Contiguous Memory
Unlike arrayed structures, link list nodes are not in contiguous memory.
Note
-- We will find out that this fact has some pros and cons regarding performance.
Linked List Whiteboard
For scratching out your ideas.
Right-Click "Save image as"
Open image and sketch on it
Data Structures And Algorithms (DSA) (Chapter 401 - Linked List Logic)
Chapter 401 - Linked List Logic
Concept
Contents
Intro
OO Review
Concepts
Design
Traversal
Algorithms
Memory
Chapter
Top
Search
TOC