VISUALISERS

Algorithm and data structure visualisers

Every visualiser on this site, each one built around a single question: what does this structure do that a picture cannot hold still?

• 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 →
• AVL tree visualiser Two trees take the same values at the same moment, one plain and one rotating. The gap between their height readouts is the argument for balancing, and it only opens while you are feeding them. Open the visualiser →
• 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 →
• 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 →
• 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 →