TREES
20 GAMES#127
Rooted Kingdom Builder
Build a binary tree node-by-node with branching paths for
left/right children.
#128
Root-Explorer Expedition
Visit Node → Left → Right in preorder sequence with glowing paths.
#129
Sorted Garden Walk
Walk Left → Node → Right revealing sorted order in BST.
#130
Digging the Subtree Mines
Explore children caves before visiting parent chamber in L-R-N
order.
#131
Tree Floor Elevator System
Ride elevators through each level reading nodes left to right.
#132
Stack Climber Challenge
Simulate iterative traversals with animated stack push/pop
operations.
#133
Vertical Pillar View
Assign horizontal distances and light up vertical pillars.
#134
Skyline Vision Quest
View the tree from above - only first node per vertical line
visible.
#135
Underworld View Chamber
View from underground - deepest visible node for each vertical
line.
#136
Leftmost Guardian Path
Traverse level order picking the first node at each level.
#137
Rightmost Guardian Path
Traverse level order picking the last node at each level.
#138
Tree Elevation Analyzer
Calculate height and depth displayed as stacked mountain layers.
#139
Balance Oracle Temple
Check if tree is balanced - visual leaning when imbalanced.
#140
Ancestor Shrine Ritual
Find LCA as light converges onto the common ancestor.
#141
Longest Ancestral Path Hunt
Find the diameter - longest path between two nodes glows gold.
#142
Inorder Chain Forge
Convert binary tree to doubly-linked list using inorder traversal.
#143
Binary Search Kingdom
Insert, search, and delete in BST with animated restructuring.
#144
BST Purity Test
Validate BST using min/max ranges - invalid nodes turn red.
#145
Order-Statistic Retrieval
Find kth smallest element with pointer scrolling through sequence.
#146
Tree Perimeter Run
Traverse the entire boundary - left, leaves, right (reverse).
HEAPS
8 GAMES#147
Heap Blossom Garden
Watch nodes bubble up to restore min-heap property.
#148
Root Extraction Ritual
Extract root, replace with last node, bubble down.
#149
Bottom-Up Heap Construction
Build heap from array starting at last non-leaf.
#150
Task Scheduler Arena
Manage tasks with priorities using dynamic heap updates.
#151
Giant Hunter Trial
Use min-heap of size K to find K largest elements.
#152
Miniature Forge
Use max-heap of size K to find K smallest elements.
#153
River Merge Cascade
Merge K sorted lists using min-heap for smallest heads.
#154
K-Displacement Lane
Sort nearly sorted array using heap of size K+1.
GRAPHS
9 GAMES#155
Wave Expansion Frontier
BFS explores level-by-level with expanding circles.
#156
Depth Trail Expedition
Dive deep along edges until dead-end, then backtrack.
#157
Loop Snare Path
Detect cycles in undirected graphs using parent tracking.
#158
Mist of Deadly Recursion
Detect cycles in directed graphs with path tracking.
#159
Order of the Ancient Tasks
Sort tasks respecting dependencies with Kahn's algorithm.
#160
Level-Jump Highway
Find shortest path in unweighted graph using BFS.
#161
Weighted Path Expedition
Dijkstra's algorithm with animated path relaxation.
#162
Unity Bridge Builder
Build MST using Kruskal's algorithm with DSU.
#163
Heuristic Maze Explorer
A* pathfinding with heuristic heatmap visualization.
TRIES
3 GAMESQUEUE + DEQUE
5 GAMES#167
Ticket Counter Flow
Visualize enqueue at back, dequeue from front - FIFO.
#168
Ring Buffer Carousel
Circular array with wrap-around index management.
#169
Double Portal Gateway
Insert and remove from both ends of deque.
#170
Peak Spotter Window
Find sliding window maximum using monotonic deque.
#171
VIP Lane Manager
Priority queue operations with heap visualization.