Simulators

Insert, search, and delete nodes in a binary search tree with real-time visualization.

Visualize how databases use B-Trees for indexing — insert keys and watch the tree split and grow.

Build and run finite state machines — define states, transitions, and test input strings.

Visualize hash table insertions, lookups, and collision resolution strategies.

Visualize A*, Dijkstra, and BFS algorithms finding the shortest path on a grid.

Visualize recursive function call trees for Fibonacci, factorial, and more.

Watch sorting algorithms in action with colorful animated bar charts.

Visualize push, pop, enqueue, and dequeue operations on stacks and queues.