Python, LintCode, 68. 二叉树的后序遍历

"""
Definition of TreeNode:
class TreeNode:
    def __init__(self, val):
        self.val = val
        self.left, self.right = None, None
"""

class Solution:
    """
    @param root: A Tree
    @return: Postorder in ArrayList which contains node values.
    """
    def postorderTraversal(self, root):
        # write your code here
        res = []  
        if root is None:  
            return res  
        else:  
            res += self.postorderTraversal(root.left)  
            res += self.postorderTraversal(root.right)  
            res += [root.val] 
            return res