如何找到给定id的路径？

class TreeNode:
    def __init__(self, id, children=None):
        self.id = id
        self.children = children if children else []

def find_path(root, target_id):
    if not root:
        return None
    
    path = []
    stack = [(root, [root])]
    
    while stack:
        node, curr_path = stack.pop()
        
        if node.id == target_id:
            path = curr_path
            break
        
        for child in node.children:
            stack.append((child, curr_path + [child]))
    
    return path