VISUALISERS

Algorithm and data structure visualisers

Each visualiser starts with one question: what can this structure do that a still picture cannot show?

• 01 / VISUALISERInteractive ↗ Binary search tree visualiser A drawing can only show one tree. Type your own values in here and the shape follows the order you chose, with the height and the best possible height side by side as they come apart. Open the visualiser →
• 02 / VISUALISERInteractive ↗ AVL tree visualiser Load the same insertion sequence into a plain search tree and an AVL tree. Compare their heights, inspect the final rotation and share a link that opens your exact example. Open the visualiser →
• 03 / VISUALISERInteractive ↗ B-tree split visualiser A split is an event, not a state. Adding keys one at a time is the only way to catch a full page breaking in half and pushing its middle key up a level, which is where a B-tree's depth comes from. Open the visualiser →
• 04 / VISUALISERInteractive ↗ Sorting algorithm visualiser The comparison counter runs while the bars move, so handing the same array to a second algorithm turns n log n from a phrase into two numbers you can watch pull apart. Open the visualiser →
• 05 / VISUALISERInteractive ↗ Dijkstra visualiser The answer is a path; the point is the order. Stepping one relaxation forwards and back shows which node settles next and why — the thing a finished shortest-path drawing has already thrown away. Open the visualiser →