This document discusses different search algorithms for traversing tree structures: - Depth-first search (DFS) explores the deepest paths first, using a stack data structure. It is complete but not optimal. - Breadth-first search (BFS) explores all nodes at each depth level first, before deeper levels, using a queue. It finds the minimum depth goal node. - Uniform cost search prioritizes exploring the lowest cost path first, using a priority queue ordered by path cost. It is optimal, finding the least cost goal node.