How do I implement Depth-First Search (DFS) in my code?

How do I implement Depth-First Search (DFS) in my code?

To implement DFS, you can use either recursion or a stack. Which method would you like to explore?

Let's go with the recursive method.

Great! Here's a simple recursive DFS implementation in Python:

def dfs(node):
    if node is None:
        return
    print(node.value)  # Process the node
    for neighbor in node.neighbors:
        dfs(neighbor)

Would you like to see an example with a specific graph?

Yes, can you show me an example with a binary tree?

Sure! Here's how you can implement DFS on a binary tree:

class TreeNode:
    def __init__(self, value):
        self.value = value
        self.left = None
        self.right = None

def dfs(node):
    if node:
        print(node.value)
        dfs(node.left)
        dfs(node.right)

This will traverse the tree in pre-order. Do you need help with anything else?