← ~/visualizations

depth-first-search #

A tree being traversed depth-first. Nodes light up in DFS order: go deep before going wide.

canvasclick to interact

⏮◀◀▶▶STEP0.25x1xZOOM

t=0s

practical uses #

• 01.Teaching DFS algorithm
• 02.Comparing to BFS traversal
• 03.Explaining stack-based traversal
• 04.Visualizing recursive exploration

technical notes #

7-node binary tree. Square nodes for blocky style. DFS order: 0,1,3,4,2,5,6. Visited nodes stay highlighted.

← big-o-complexitybreadth-first-search →