如何查找从根到节点的路径(python 3.6)

class Node:
    def __init__(self, value, children=[]):
        self.value = value
        self.children = children

def find_path(root, target):
    path = []
    stack = [(root, [root.value])]
    
    while stack:
        node, current_path = stack.pop()
        
        if node.value == target:
            path = current_path
            break
        
        for child in node.children:
            stack.append((child, current_path + [child.value]))
    
    return path