代码随想录算法训练营第十三天｜144.二叉树的前序遍历、145.二叉树的后序遍历、94.二叉树的中序遍历

二叉树递归法

代码随想录代码随想录PDF，代码随想录网站，代码随想录百度网盘，代码随想录知识星球，代码随想录八股文PDF，代码随想录刷题路线，代码随想录知识星球八股文https://programmercarl.com/%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%80%92%E5%BD%92%E9%81%8D%E5%8E%86.html#%E6%80%9D%E8%B7%AF

144.二叉树的前序遍历

#递归法
# 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: Optional[TreeNode]) -> List[int]:
        res = []
        if root is None:
            return res
        
        self.helper(res, root)
        return res

    def helper(self, res: List[int], root: TreeNode):
        if root is None:
            return
        res.append(root.val)
        self.helper(res, root.left)
        self.helper(res, root.right)

145.二叉树的后序遍历

#递归法
# 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 __init__(self):
        self.res = []  # 初始化结果列表

    def postorderTraversal(self, root: TreeNode) -> List[int]:
        if root is None:
            return self.res
        
        self.helper(root)
        return self.res

    def helper(self, root: TreeNode):
        if root is None:
            return
        
        self.helper(root.left)
        self.helper(root.right)
        self.res.append(root.val)

        

94.二叉树的中序遍历

#递归法
# 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 __init__(self):
        self.res = []  # 初始化结果列表

    def inorderTraversal(self, root: TreeNode) -> List[int]:
        self.res = []  # 重置结果列表
        self.helper(root)
        return self.res

    def helper(self, root: TreeNode):
        if root is None:
            return
        
        self.helper(root.left)
        self.res.append(root.val)
        self.helper(root.right)