In depth first search of a search tree, one progresses by first looking as deeply as possibly down the left most branch of each node one encounters, and then each successive branch in order. This is one of the simplest search strategies alongside breadth first search.
Used in Chap. 4: pages 43, 44, 45, 46, 48, 50, 53, 54, 55; Chap. 18: pages 275, 276
Also known as depth first, depth first
Depth first search – order of visiting nodes.