- Binary Tree Preorder Traversal
https://leetcode.com/problems/binary-tree-preorder-traversal/submissions/
数据结构基础
class Solution:
def preorderTraversal(self, root: TreeNode) -> List[int]:
orderlist = []
self.helper(root, orderlist)
return orderlist
def helper(self, root, orderlist):
if root is None:
return
orderlist.append(root.val)
self.helper(root.left, orderlist)
self.helper(root.right, orderlist)