Tree search represents possible decisions as branches from a current state, with each path showing a sequence of actions and outcomes. Comparing simulated paths can guide a choice before it is made. section 4.1
Choosing a delivery route
Start at a depot, branch into North or South routes, then add choices about which customer to visit first. Each completed plan has an accumulated cost. Searching the tree helps compare routes rather than treating the initial choice in isolation. section 7.1
Breadth-first search explores all paths at one depth before going deeper; depth-first search follows one branch to its end before returning to alternatives. BFS finds a shortest route when each step has equal cost, while the route example compares total travel costs. section 7.2
Figure 7.1 Tree data structure in vehicle route planning problem
A route-planning tree illustrates how customer choices branch beneath an initial route decision. section 7.1
