Chapter 1, Understanding the Depth-First Search Algorithm, practically explains the DFS algorithm with the help of a search tree. The chapter also delves into recursion, which eliminates the need to have an explicit stack.
Chapter 2, Understanding the Breadth-First Search Algorithm, teaches you how to traverse a graph layer-wise using a LinkedIn connection feature as an example.
Chapter 3, Understanding the Heuristic Search Algorithm, takes you through the priority queue data structure and explains how to visualize search trees. The chapter also covers problems related to greedy best-first search, and how A* solves that problem.
