leetcode题解记录-144二叉树的前序遍历（python3）

题目

二叉树的前序遍历
题目链接
官方题解

关键词

二叉树，递归，栈

代码记录

方法一 递归

# 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: TreeNode) -> List[int]:
    	res=[]
    	def search(root):
    		if root:
    			res.append(root.val)
    			if root.left:
    				search(root.left)
    			if root.right:
    				search(root.right)
    	search(root)
    	return res

方法二 迭代

# 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: TreeNode) -> List[int]:
    	res=[]
    	stack=[root]
    	while stack:
    		node=stack.pop()
    		if node:
    			res.append(node.val)  			
	    		if node.right:
	    			stack.append(node.right)
	    		if node.left:
	    			stack.append(node.left)
    	return res