LintCode 68. Binary Tree Postorder Traversal

题目

思路

非递归后序遍历。

代码

"""
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_list = []
        stack = []
        lastNode = root
        if root: stack.append(root)
        while stack:
          node = stack[-1]
          if node.left and lastNode != node.left and lastNode != node.right:
              stack.append(node.left)
          elif node.right and lastNode != node.right:
              stack.append(node.right)
          else:
              res_list.append(node.val)
              stack.pop(-1)
              lastNode = node
        return res_list