python traverse n-ary tree depth-first without recursion

.py

def dfs_traverse(root):
    stack = []
    stack.append(root)

    while (stack):
        node = stack.pop()
        for child in node.children:
            stack.append(child)
        process_node(node)