Linear Structures
Elements organized sequentially. Linked Lists, Stacks, and Queues form the foundation of memory-efficient data handling with pointer-based navigation.
Hierarchical Trees
Non-linear structures enabling O(log n) search. Binary Search Trees organize data for fast lookups, while Tries excel at prefix-based string operations.
Self-Balancing
AVL Trees and Heaps guarantee consistent performance by automatically rebalancing on every insert or delete — no worst-case O(n) traversals.
Interactive Visualizers
Linked Lists
Visualize pointers and nodes as they are added, removed, and searched in an interactive singly linked list with full pointer animations.
- Head/tail pointer tracking
- Insert at any index
- In-place reversal animation
Stack & Queue
Master LIFO and FIFO principles with an interactive dual-mode visualizer. Switch between Stack and Queue with a single click.
- LIFO push/pop for Stack
- FIFO enqueue/dequeue for Queue
- Live top/front value tracking
Binary Heap
Learn how Max/Min Heaps maintain their property through array-based tree structures with animated heapify operations.
- Max & Min heap toggle
- Step-by-step heapify up/down
- Array ↔ tree dual view
AVL Tree
Observe how self-balancing trees perform rotations (LL, RR, LR, RL) to maintain O(log n) performance on every operation.
- All 4 rotation types animated
- Live balance factor per node
- Tree height tracking
Trie (Prefix Tree)
Explore how prefix trees store dictionary strings for efficient searching and autocompletion with character-by-character traversal.
- Word insertion with path highlight
- Prefix search with glow animation
- Word bank chip display
Binary Search Tree
Learn tree insertion, searching, and traversal logic visually with hierarchical nodes and animated in-order / pre-order / post-order results.
- Insert, delete, search animations
- 3-mode traversal selector
- Min / max value tracking