Linked lists unlock dynamic memory usage. They allow constant-time insertions and deletions at the head and flexible growth—critical for implementing stacks, queues, and more advanced structures.

On this page

Overview
Why Linked Lists?
Learning Objectives

What is a Linked List?

A linked list is a sequence of nodes where each node stores a piece of data and a reference to the next node (and optionally the previous one). Unlike arrays, elements are not stored in contiguous memory; this enables flexible insertion and removal without shifting elements.

Arrays (Static)

• Fixed capacity
• Contiguous memory layout
• O(1) indexed access
• Costly insert/delete in middle

Linked Lists (Dynamic)

• Dynamic growth
• Non-contiguous nodes
• O(1) head operations
• Sequential access only

Why Use Linked Lists?

Advantages

Dynamic size with no reallocation
Efficient insert/delete at head
Memory usage grows as needed

Trade-offs

• Extra pointer/reference per node
• Poor cache locality
• No random indexing

Learning Objectives

Structure & Nodes

Dynamic Memory

Head/Tail Operations

Traversal Basics

Use Cases

Trade-offs

Quick Knowledge Check

What makes linked lists better than arrays for frequent head insertions?

EASY

Primary trade-off of using a linked list instead of a dynamic array?

MEDIUM

Previous: Pointers & Memory Next: Types

Quick Knowledge Check

What makes linked lists better than arrays for frequent head insertions?

EASY

Primary trade-off of using a linked list instead of a dynamic array?

MEDIUM