Available visualizers
BFS
Breadth-first traversal with queue-based graph exploration.
Binary Tree Traversal
Visualize preorder, inorder, and postorder tree traversals.
Bubble Sort
Simple sorting algorithm with step-by-step comparisons and swaps.
DFS
Depth-first graph traversal with stack-based step navigation.
Doubly Linked List
Bidirectional linked list with insert and delete operations.
Heap Sort
Heap-based sorting with max heap construction and extraction.
Coming soon
More algorithm visualizers will appear here.