如何从节点树中查找路径

def dfs(node, target, path, result):
    if node is None:
        return
    
    path.append(node)
    
    if node == target:
        result.append(path.copy())
    else:
        for child in node.children:
            dfs(child, target, path, result)
    
    path.pop()

def find_path(root, target):
    result = []
    dfs(root, target, [], result)
    return result

from collections import deque

def bfs(root, target):
    queue = deque([(root, [root])])
    result = []
    
    while queue:
        node, path = queue.popleft()
        
        if node == target:
            result.append(path)
        
        for child in node.children:
            queue.append((child, path + [child]))
    
    return result

def find_path(root, target):
    return bfs(root, target)