二叉树前中后序遍历非递归实现

最新推荐文章于 2024-07-19 17:37:28 发布

Calculus2022

最新推荐文章于 2024-07-19 17:37:28 发布

阅读量84

点赞数

文章标签： java 开发语言

本文链接：https://blog.csdn.net/qq_43530796/article/details/132948076

版权

前序遍历

public static void prifixOrder(TreeNode root){
        System.out.print("前序遍历： ");
        Stack<TreeNode> stack = new Stack<>();
        stack.push(root);
        while (!stack.isEmpty()){
            TreeNode pop = stack.pop();
            if (pop.right != null) stack.push(pop.right);
            if (pop.left != null) stack.push(pop.left);
            System.out.print(pop.val + " ");
        }
        System.out.println();
    }
   
}

中序遍历

 public static  void infixOrder(TreeNode root){
        System.out.print("中序遍历： ");
        Stack<TreeNode> stack = new Stack<>();
        TreeNode cur = root.left;
        stack.push(root);
        while (!stack.isEmpty() || cur != null){
            if (cur != null){
                stack.push(cur);
                cur = cur.left;
            }else {
                TreeNode pop = stack.pop();
                System.out.print(pop.val + " ");
                cur = pop.right;
            }
        }
        System.out.println();
    }

后序遍历

public static  void postOrder(TreeNode root){
        System.out.print("后序遍历： ");
        Stack<TreeNode> stack = new Stack<>();
        Stack<TreeNode> stack2 = new Stack<>();
        stack.push(root);
        while (!stack.isEmpty()){
            TreeNode pop = stack.pop();
            stack2.push(pop);
            if (pop.left != null) stack.push(pop.left);
            if (pop.right != null)stack.push(pop.right);
        }
        while (!stack2.isEmpty()){
            System.out.print(stack2.pop().val + " ");
        }
        System.out.println();
    }