java非递归实现二叉树遍历

前序遍历：

public List<Integer> preOrder(TreeNode root){
    List<Integer> preret = new LinkedList<>();
    if(root==null)
        return preret;
    Stack<TreeNode> stack = new Stack<>();
    while (!stack.isEmpty()||root!=null){
        //存入当前根节点,遍历到最左
        while (root!=null){
            preret.add(root.val);
            stack.push(root);
            root = root.left;
        }
        if(!stack.isEmpty()){
            //弹出当前最左子节点，指向它的右子树
            root = stack.pop();
            //右子树不为空时会先打印右子树的根
            //再重复压入右子树的左子节点
            //右子树为空则弹出上一层的根节点
            //并遍历根节点的右子树
            root = root.right;
        }
    }
    return preret;
}

中序遍历

public List<Integer> inOrder(TreeNode root){
    List<Integer> inret = new LinkedList<>();
    if(root==null)
        return inret;
    Stack<TreeNode> stack = new Stack<>();
    while (!stack.isEmpty()||root!=null){
        //遍历到最左子节点
        while (root!=null){
            stack.push(root);
            root = root.left;
        }
        if(!stack.isEmpty()){
            //每次弹出最左子节点并保存
            root = stack.pop();
            inret.add(root.val);
            //指向节点的右子树，进入下一次循环
            root = root.right;
        }
    }
    return inret;
}

后序遍历

public List<Integer> postOrder(TreeNode root){
    List<Integer> postret = new LinkedList<>();
    if(root==null)
        return postret;
    Stack<TreeNode> stack = new Stack<>();
    while (!stack.isEmpty()||root !=null){
        //遍历到最左
        while (root!=null){
            stack.push(root);
            root = root.left;
        }
        boolean isRight = true;
        TreeNode preNode = null;
        while(!stack.isEmpty()&&isRight==true){
            root = stack.peek();
            if(root.right==preNode){
                root = stack.pop();
                postret.add(root.val);
                if (stack.isEmpty())
                    return postret;
                else
                    preNode = root;
            }
            else {
                root = root.right;
                isRight = false;
            }
        }
    }
    return postret;
}