38：之字型打印二叉树

最新推荐文章于 2024-02-18 10:31:45 发布

oldGarlic

最新推荐文章于 2024-02-18 10:31:45 发布

阅读量93

点赞数

分类专栏：剑指offer

本文链接：https://blog.csdn.net/qq_40008535/article/details/107731185

版权

剑指offer 专栏收录该内容

56 篇文章 0 订阅

订阅专栏

之字型打印二叉树

二叉树层次遍历的变种，我们可以使用两个栈来保存待打印数据即可

public class Offer38 {

    public static void main(String[] args) {
        TreeNode node = Main.createNode();
        cengci(node);
    }

    public static void cengci(TreeNode root){
        if (root==null)return;
        //先存树的左边，再存右边
        Stack<TreeNode> stack1 = new Stack<>();
        //先存树的右边，再存左边
        Stack<TreeNode> stack2 = new Stack<>();

        int nextLevel = 0;
        int toBePrinted = 1;
        stack1.push(root);
        while (!stack1.isEmpty()||!stack2.isEmpty()){
            if(!stack1.isEmpty()&&stack2.isEmpty()){
                TreeNode pop = stack1.pop();
                System.out.print(pop.value+" ");
                toBePrinted--;
                if(pop.left!=null){
                    stack2.push(pop.left);
                    nextLevel++;
                }
                if(pop.right!=null){
                    stack2.push(pop.right);
                    nextLevel++;
                }
            }else{
                TreeNode pop = stack2.pop();
                System.out.print(pop.value+" ");
                toBePrinted--;
                if(pop.right!=null){
                    stack1.push(pop.right);
                    nextLevel++;
                }
                if(pop.left!=null){
                    stack1.push(pop.left);
                    nextLevel++;
                }
            }

            if(toBePrinted==0){
                System.out.println();
                toBePrinted = nextLevel;
                nextLevel=0;
            }
        }

    }

}