Linked Lists

Dynamic linear data structures where nodes are connected via pointers. Explore memory allocation, traversal, and pointer manipulation.

Operations

Value Control

List Configuration

Implementation Code

Pseudocode

Python

1function insertHead(value):
2    newNode = Node(value)
3    newNode.next = head
4    head = newNode

HEAD POINTER

NODE 0

0x1

NODE 1

0x2

NODE 2

0x3

NULL

Initial state

AccessO(N)

SearchO(N)

InsertO(1)*

DeleteO(1)*

* O(1) assuming the pointer to the location is already available.