Difference between Depth First Search, Breadth First Search, and Depth Limit Search

BFS: queue, level by level, shortest hops if cost=1, more memory. DFS: stack, deep first, less memory, can miss nearby goals, may loop without a visited set. A*: g+h, optimal with admissible h, needs a good heuristic.

One table, three rows. That beats a speech.

Difference between Depth First Search, Breadth First Search, and Depth Limit Search — output: three exam lines. Graph on paper first.