leetcode 145 二叉树的后续遍历

题目

给定一个二叉树，返回它的 后序 遍历

代码

小结：思路同N叉树的后续遍历。https://blog.csdn.net/jone5679/article/details/90664627

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

class Solution(object):
    def postorderTraversal(self, root):
        """
        :type root: TreeNode
        :rtype: List[int]
        """
        if root == None:
            return
        s = [root]
        res = []
        while s:
            cur = s.pop()
            res.insert(0, cur.val)
            if cur.left:
                s.append(cur.left)
            if cur.right:
                s.append(cur.right)
        return res