Hands-on stack, queue, linked list, and hash table — every push, pop, pointer rewire, and collision narrated with its O(1)/O(n) cost, plus an interactive Big-O growth explorer.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
Data Structure Playground is a hands-on lab for the four structures every programmer must know: stack, queue, linked list, and hash table. Every operation — push, pop, enqueue, pointer rewire, hash collision — animates the structure and narrates what happened with its real O(1) or O(n) cost. A Big-O growth explorer at the bottom turns complexity classes into curves you can drag.
The queue drives BFS; the stack drives DFS — see them in action.
Open toolValues enter and leave only at the top — like a pile of plates.
| Class | Steps at n = 32 | Typical algorithms |
|---|---|---|
| O(1) | 1 | hash lookup, stack push |
| O(log n) | 5 | binary search, BST ops |
| O(n) | 32 | linear scan, list reverse |
| O(n log n) | 160 | merge/heap/quick sort |
| O(n²) | 1,024 | bubble sort, nested loops |
| O(2ⁿ) | >1 billion | brute-force subsets |
