给你二叉树的根节点 root
,返回它节点值的 前序 遍历。
例:
输入:root = [1,null,2,3] 输出:[1,2,3]
解析:
递归遍历
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution(object):
def preorderTraversal(self, root):
"""
:type root: TreeNode
:rtype: List[int]
"""
if root is None: # 判空,判断此节点
return []
return [root.val] + self.preorderTraversal(root.left) + self.preorderTraversal(root.right) # 根节点+左节点+右节点