DSA Visualizer

Watch algorithms run step-by-step

Linked List
Node traversal & pointer manipulation
Interactive
HEAD
val
12
next→
[0]
val
8
next→
[1]
val
23
next→
[2]
val
5
next→
[3]
val
17
next→
[4]
null
Active
Newly added
Normal
Linked List
Insert Head: O(1)
Insert Tail: O(n)
Delete: O(n)
Access: O(n)
Graph (BFS)
Time: O(V + E)
Space: O(V)
Uses: Queue
Finds: Shortest path
Binary Tree
Insert: O(log n)
Search: O(log n)
Inorder = sorted
Height: O(log n)
Bubble Sort
Best: O(n)
Avg: O(n²)
Worst: O(n²)
Space: O(1) in-place