class Solution(object):
def __init__(self):
self.res = []
def preorderTraversal(self, root):
# res = [] 递归时注意不要把结果初始化放在其中,否则会改变
if root == None:
return []
self.res.append(root.val)
self.preorderTraversal(root.left)
self.preorderTraversal(root.right)
return self.res
class Solution:
def preorderTraversal(self, root):
if not root:
return []
res = []
stack = [root]
# # 前序迭代模板:最常用的二叉树DFS迭代遍历模板
while stack:
cur = stack.pop()
res.append(cur.val)
if cur.right:
stack.append(cur.right)
if cur.left:
stack.append(cur.left)
return res
# 注意因为前序遍历是两边交替读取,故压入是逆序压入