These are algorithms that traverse a tree graph in various ways, such as depth-first or breadth-first.