Leetcode-144. Binary Tree Preorder Traversal 二叉树的前序遍历 -python

最新推荐文章于 2022-03-02 16:54:38 发布

简米

最新推荐文章于 2022-03-02 16:54:38 发布

阅读量225

点赞数

分类专栏： Leetcode 文章标签： leetcode 算法二叉树 python

本文链接：https://blog.csdn.net/JamieLuo/article/details/106294490

版权

Leetcode 专栏收录该内容

83 篇文章 1 订阅

订阅专栏

题目

给定一个二叉树，返回它的前序遍历。
链接：https://leetcode.com/problems/binary-tree-preorder-traversal/

Given a binary tree, return the preorder traversal of its nodes’ values.

Example:

Input: [1,null,2,3]
1
\
2
/
3
Output: [1,2,3]

思路及代码

先序遍历
中序遍历
后序遍历

1. DFS Recursion

# 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]:
        def dfs(node):
            if not node:
                return
            ans.append(node.val)
            dfs(node.left)
            dfs(node.right)
            
        ans = []
        dfs(root)
        return ans

2. Iteration

class Solution:
    def preorderTraversal(self, root: TreeNode) -> List[int]:
        ans = []
        if not root:
            return ans
        stack = []
        cur = root
        while cur or stack:
            while cur:
                ans.append(cur.val)
                stack.append(cur)
                cur = cur.left
            cur = stack.pop()
            cur = cur.right
        return ans