Linked Lists – Dynamic Memory

Before You Apply

First observe the behavior in Explore mode, then switch to Apply to test each operation with intent.

Core Idea

A linked list is a dynamic data structure where elements (nodes) are connected via pointers/references. Unlike arrays, linked lists don't require contiguous memory and can grow dynamically.

Observe This First

Nodes: Data + pointer to next node

Then Apply

Array - Access arr[i]: O(1) | Linked List - Access: O(n)

Linked Lists – Dynamic Memory Lab

Arrows show pointers. Access follows links node by node from HEAD.

2null

Ready|Waiting for a linked list operation

Time: Depends on operation|Space: O(1) auxiliary

Current

Comparing

Correct / Inserted

Removed

Pseudocode

1follow HEAD to the target node

2locate current tail node

3set tail.next to the new node

4find node before the target

5bypass target by reconnecting next pointer

6traverse by following next pointers

Linked lists move by pointers, so reaching a node means following links from HEAD.

Explore mode: click nodes and follow arrows to understand pointer links.

Understanding the Observation

What did you observe?

Head: First node in the list

Why did this happen?

Nodes: Data + pointer to next node

Apply with purpose

In Apply mode, test one operation and explain its complexity before running the next.

Predict next

Before clicking run, predict the next index/pointer movement and then verify it.