LeetCode之后序迭代遍历

问题描述：

/**
 * Given a binary tree, return the postorder traversal of its nodes' values.
 *
 * For example:
 * Given binary tree {1,#,2,3},
 *   1
 *    \
 *     2
 *    /
 *   3
 * return [3,2,1].
 *
 * Note: Recursive solution is trivial, could you do it iteratively?
 * 
 * Solution:
 * 
 * 1. Root - Right - Left
 * 2. Then reverse the sequence
 * 3. Left - Right - Root
 *
 */

在后序非递归遍历时，要借助栈的操作，由于栈是先进后出，所以在后序遍历时要先压入右孩子，这样才能保证在栈的弹出操作时会优先弹出左孩子。

public class BinaryTreePostorderTraversal {
     public static ArrayList<Integer> postorderTraversal(TreeNode root) {
            ArrayList<Integer> ret = new ArrayList<Integer>();
            if (root == null)
                return ret;
            Stack<TreeNode> st = new Stack<TreeNode>();
            TreeNode p = root.right;
            ret.add(root.val);
            st.add(root);
            while (!st.isEmpty()) {
                while (p != null) {
                    ret.add(p.val);
                    st.add(p);
                    p = p.right;
                }
                TreeNode node = st.pop();
                p = node.left;
                if (p != null) {
                    ret.add(p.val);
                    st.add(p);
                    p = p.right;
                }
            }
            int i = 0;
            int j = ret.size() - 1;
            while(i < j) {//数组逆置就得到后序遍历的结果
                int tmp = ret.get(i);
                ret.set(i, ret.get(j));
                ret.set(j, tmp);
                i++;
                j--;
            }
            return ret;
        }
    //测试代码
        public static void main(String arg[])
        {
            TreeNode r1 = new TreeNode(3);  
            TreeNode r2 = new TreeNode(9);  
            TreeNode r3 = new TreeNode(20);  
            TreeNode r4 = new TreeNode(15);
            TreeNode r5 = new TreeNode(7);
            TreeNode r6 = new TreeNode(10);
            r1.left = r2;  
            r1.right = r3;  
            r2.left=r4;
            r3.right=r5;
            r3.left=r6;
            ArrayList<Integer> array=postorderTraversal(r1);
            for(int i=0;i<array.size();i++)
            {
                System.out.print(array.get(i)+",");
            }

        }
}