A24021. 以下代码实现了二叉树的中序遍历，输入以下二叉树，中序遍历结果是 4 2 5 1 3 6 。（ ）# 1 # / \ # 2 3 # / \ \ # 4 5 6 class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = None def inorder_iterative(root): sta…

以下代码实现了二叉树的中序遍历，输入以下二叉树，中序遍历结果是 4 2 5 1 3 6 。（ ）

#      1
#     / \
#    2   3
#   / \   \
#  4   5   6
class TreeNode:
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None

def inorder_iterative(root):
    stack = []
    curr = root

    while curr or stack:
        while curr:
            stack.append(curr)
            curr = curr.left

        curr = stack.pop()
        print(curr.val, end=" ")

        curr = curr.right