Algorithms & Traversal: BFS, DFS, and the Searches You'll Reach For

What's the only line of code that differs between the lesson's BFS and DFS crawler implementations?

• ABFS uses `requests.get`, DFS uses `httpx`
• BBFS uses `deque.popleft()` (dequeue from front), DFS uses `list.pop()` (pop from end). Same code shape, different traversal order.
• CBFS is recursive, DFS is iterative
• DBFS skips already-visited URLs, DFS does not