给定Python中二叉树节点的定义如下，下列选项中是二叉树前序遍历的正确递归实现的是？

ny213716 单选题共个子题

二叉树节点定义代码：

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

def preorder(root: TreeNode) -> None:
    if not root:
        return
    print(root.val)
    preorder(root.left)
    preorder(root.right)

def preorder(root: TreeNode) -> None:
    if not root:
        return
    preorder(root.left)
    print(root.val)
    preorder(root.right)

def preorder(root: TreeNode) -> None:
    if not root:
        return
    preorder(root.left)
    preorder(root.right)
    print(root.val)

def preorder(root: TreeNode) -> None:
    print(root.val)
    preorder(root.left)
    preorder(root.right)

正在加载题目数据…

第空

已答 /

子题

第空

提示

该题型需在试卷/作业中作答，单题练习暂不支持

答案解析