二叉树遍历

Posted 2021-02-05 yejiang

后序递归：

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def postorderTraversal(self, root):
        """
        :type root: TreeNode
        :rtype: List[int]
        """
        if root == None:
            return []
        return self.postorderTraversal(root.left)+self.postorderTraversal(root.right)+[root.val]