leetcode 打卡 day14

二叉树

二叉树定义：

 # 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

144. 二叉树的前序遍历 145.二叉树的后序遍历 94.二叉树的中序遍历

144. 二叉树的前序遍历

1、前序遍历： 中左右
2、构建辅助函数 traversal

# 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 traversal(root):
            if root == None:
                return 
            res.append(root.val)
            traversal(root.left)
            traversal(root.right)
        traversal(root)
        return res 
        

145.二叉树的后序遍历

1、后序遍历： 左右中
2、构建辅助函数 traversal

# 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 traversal(root):
            if root == None:
                return 
            traversal(root.left)
            traversal(root.right)
            res.append(root.val)
        traversal(root)
        return res

94.二叉树的中序遍历

1、中序遍历： 左中右
2、构建辅助函数 traversal

# 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 traversal(root):
            if not root:
                return
            traversal(root.left)
            res.append(root.val)
            traversal(root.right)
        traversal(root)
        return res