# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def preorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
# if not root:
# return []
# left = preorderTraversal(root.left)
# right = preorderTraversal(root.right)
# return [root.val]+left+right
if not root:
return []
left = self.preorderTraversal(root.left)
right = self.preorderTraversal(root.right)
return [root.val] + left + right
07-29
550
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
04-14
1995
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
07-16
“相关推荐”对你有帮助么?
-
非常没帮助
-
没帮助
-
一般
-
有帮助
-
非常有帮助
提交