A* Search

Heuristic-driven shortest path search balancing speed and optimality.

AVL Rotations

Balance-factor-driven single and double rotation visual explanation.

Bellman-Ford

Edge-relaxation rounds including negative-cycle detection semantics.

Bidirectional BFS

Two-ended BFS expansion to demonstrate frontier intersection optimization.

Binary Search

Low-level search baseline illustrating midpoint decision boundaries.

Breadth-First Search

Layer-by-layer traversal that guarantees shortest paths in unweighted graphs.

BST Operations

Binary search tree insertion, lookup, and deletion walkthroughs.

Bubble Sort

Baseline sorting visual to introduce comparisons, swaps, and pass optimization.

Counting Sort

Value-range-based stable sorting walkthrough using buckets, prefix sums, and output placement.

Depth-First Search

Depth-prioritized traversal useful for connectivity and structure discovery.

Dijkstra

Deterministic shortest path baseline for weighted graphs with non-negative edges.

Heap Sort

Heap-backed sorting sequence visualizing sift-up and sift-down operations.

Insertion Sort

Incremental insertion flow ideal for understanding nearly sorted behavior.

Invert Binary Tree

Mirror a binary tree by swapping each node's left and right children.

Kruskal MST

Greedy edge selection for MST construction with cycle avoidance feedback.

Merge Sort

Stable divide-and-conquer sort with predictable O(n log n) behavior.

Prim MST

Vertex growth process for MST formation emphasizing candidate edge relaxation.

Quick Sort

Partition-based sort known for strong average-case performance.

Selection Sort

Selection-based sorting walkthrough focused on invariant tracking across partitions.

Topological Sort

Directed acyclic graph ordering with indegree queue transitions.

Trie Operations

Prefix tree operations showcasing branching and shared-prefix structure.

Union-Find

Component connectivity visual with path compression and union by rank.