Depth-first search is so named because the recursion goes deep in the tree before it goes across. The above diagram shows the order in which nodes of a search tree are examined.
Usually, the search will quit and return an answer when a node is either a terminal failure node or a goal node.
Depth-first search is often preferred because of its low O(log(n)) storage requirement.