Linked List Monster
Singly & Doubly linked lists — insert at head/tail/position, delete, search, reverse with pointer animations.
0
List Length
—
Head Value
—
Tail Value
0
Operations
SINGLY LINKED LIST
Node Chain View
Empty — insert nodes to begin
Operation Log
Insert nodes at head, tail, or a specific position.
Find the Node
0
What position is a given value at? Race against the clock!
Time Complexity
Insert at Head
O(1)
Insert at Tail
O(1)*
Insert at Position
O(n)
Search
O(n)
Delete by Value
O(n)
Pointer Magic
HEAD: First node in the list
TAIL: Last node (
next = NULL)Doubly: Each node has
prev pointer tooCircular: Tail's
next → HEAD