LeetCode145. 二叉树的后序遍历

题目来源：

https://leetcode-cn.com/problems/binary-tree-postorder-traversal/

题目描述：

代码如下：

解法一（递归）：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
        List<Integer> list = new ArrayList<>();
        if(root!=null) {
        	postorderTraversal(root,list);
        }
        return list;
    }
    
    private void postorderTraversal(TreeNode root,List<Integer> list) {
    	if(root!=null) {
    		postorderTraversal(root.left,list);
    		postorderTraversal(root.right,list);
    		list.add(root.val);
    	}
    }
}

解法二（迭代）：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
	public List<Integer> postorderTraversal(TreeNode root) {
		List<Integer> list = new ArrayList<>();
		Stack<TreeNode> stack = new Stack<>();
		// cur为当前遍历的结点，last为上一个遍历的结点。
		TreeNode cur, last = null;
		while (root != null || !stack.empty()) {
			while (root != null) {
				stack.push(root);
				root = root.left;
			}
			cur = stack.peek();
			if (cur.right == null || cur.right == last) {
				last = stack.pop();
				list.add(last.val);
			} else {
				root = cur.right;
			}
		}
		return list;
	}
}