非递归方法实现二叉树的遍历

1.前序遍历

// 非递归实现前序遍历
    void preOrderTraversal2(BTNode root){
        if(root == null) return;
        Stack<BTNode> stack = new Stack<>();
        BTNode cur = root;

        while (cur!=null||!stack.empty()){

            while (cur!=null){
                stack.push(cur);
                System.out.print(cur.val + " ");
                cur = cur.left;
            }
            BTNode top = stack.pop();
            cur = top.right;
        }
        System.out.println();
    }

2.中序遍历（原理同前序遍历）

void inOrderTraversal2(BTNode root){
        if(root == null) return;
        Stack<BTNode> stack = new Stack<>();
        BTNode cur = root;

        while (cur!=null||!stack.empty()){

            while (cur!=null){
                stack.push(cur);

                cur = cur.left;
            }
            BTNode top = stack.pop();
            System.out.print(top.val+" ");
            cur = top.right;
        }
        System.out.println();

    }

3.后序遍历

void postOrderTraversal2(BTNode root){
        if(root == null) return;
        Stack<BTNode> stack = new Stack<>();
        BTNode cur = root;
        BTNode prev = null;//标记打印过的节点。这里比较重要，不然会陷入死循环
        while (cur!=null||!stack.empty()){

            while (cur!=null){
                stack.push(cur);
                cur = cur.left;
            }
            BTNode top = stack.peek();

            if(top.right == null || top.right == prev){
                stack.pop();
                System.out.print(top.val+" ");
                prev = top;
            }else {
                cur = top.right;
            }

        }
    }