Search Algorithms in Trees

Build your own search trees and follow exactly how BFS, DFS, Greedy Best-First, and A* explore every node.

Choose algorithm

Cost –

Enter saves

Example trees

Start a search to see the data structure live.

Four classic search algorithms make their way through the same tree. Follow how they work, node by node.

Choose a tree. Load an example tree or build your own.

Pick an algorithm. The options are BFS, DFS, Greedy best-first and A*.

Compare. Note which path each algorithm finds and how many nodes it has to examine.