A24039. 请将下列树的深度优先遍历代码补充完整，横线处应填入（ ）。class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = None def dfs(root): if not root: return _______________________ stack.append(root) while…

请将下列树的深度优先遍历代码补充完整，横线处应填入（    ）。

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

def dfs(root):
    if not root:
        return
    _______________________
    stack.append(root)

    while stack:
        node = stack.pop()
        print(node.val, end=" ")

        if node.right:
            stack.append(node.right)
        if node.left:
            stack.append(node.left)