An important application when working with trees is the ability to search them for data they may hold. In this section we describe two algorithms for searching trees: depth first search (DFS) and breadth first search (BFS). These two algorithms have simple variations for searching digraphs and graphs but these are not followed up here.