Interactive Algorithms Suite

Visualize Trees, Sorting, and Searching

Jump into any topic using the navigation bar or start from the cards below. Every page offers inputs, visual feedback, and textual explanations tailored to the algorithm.

Structure & Traversals

Work with binary trees reconstructed from two traversals.

Provide any two orders (inorder, preorder, postorder) to rebuild the tree, draw it, and generate the missing traversal with a structural explanation.

Open Binary Tree Builder →

Sorting Lab

Compare and learn five popular sorting techniques.

Searching Studio

See how linear and binary search traverse an array.