代码随想录算法训练营第14天｜二叉树（一）

最新推荐文章于 2024-07-17 21:46:52 发布

qq_41634533

最新推荐文章于 2024-07-17 21:46:52 发布

阅读量213

点赞数 2

文章标签：算法

本文链接：https://blog.csdn.net/qq_41634533/article/details/139527913

版权

处于疯狂赶进度中，二叉树的遍历，先完成里递归法，二刷完成迭代法

题目链接：144.二叉树的前序遍历

二叉树前序遍历，递归法

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution(object):
    def preorderTraversal(self, root):
        """
        :type root: TreeNode
        :rtype: List[int]
        """
        res=[]

        def dfs(node):
            if node is None:
                return 
            res.append(node.val)
            dfs(node.left)
            dfs(node.right)
        dfs(root)
        return res

题目链接：94.二叉树中序遍历

中序遍历，递归法

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution(object):
    def inorderTraversal(self, root):
        """
        :type root: TreeNode
        :rtype: List[int]
        """
        res=[]
        def inorder(node):
            if node is None:
                return
            inorder(node.left)
            res.append(node.val)
            inorder(node.right)
        inorder(root)
        return res

题目链接：145.二叉树后序遍历

后序遍历，递归法

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution(object):
    def postorderTraversal(self, root):
        """
        :type root: TreeNode
        :rtype: List[int]
        """
        res=[]
        def postorder(node):
            if node is None:
                return 
            postorder(node.left)
            postorder(node.right)
            res.append(node.val)
        postorder(root)
        return res