PTA 按层次遍历二叉树 java

最新推荐文章于 2024-09-08 22:18:54 发布

aiworenyanzhousuanfa

最新推荐文章于 2024-09-08 22:18:54 发布

阅读量731

点赞数

分类专栏：树文章标签： PTA 按层次遍历二叉树 java

本文链接：https://blog.csdn.net/aiwo1376301646/article/details/93905358

版权

树专栏收录该内容

16 篇文章 0 订阅

订阅专栏

题目链接：https://pintia.cn/problem-sets/1120858298571182080/problems/1120858729061961728

package pat树;
//ac
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;

public class Main按层次遍历二叉树 {
    static String s;
    static node root;
    static int i;
    static Queue<node>q=new LinkedList<node>();
    static char a;
    
    public static node build() {
    	a=s.charAt(i++);
    	node jiedian=new node();
    	if(a!='#') {
    		jiedian.v=a;
    		jiedian.le=build();
    		jiedian.ri=build();
    	}
    	else {
    		jiedian=null;
    	}
    	return jiedian;
    }
    public static void print() {
    	while(!q.isEmpty()){
    		root=q.poll();
    		System.out.print(root.v);
    		if(root.le!=null)q.add(root.le);
    		if(root.ri!=null)q.add(root.ri);
    	}
    }
	public static void main(String[] args) {
		Scanner in=new Scanner(System.in);
		s=in.nextLine();
		root=build();
		q.add(root);
		print();

	}

}
class node{
	char v;
	node le;
	node ri;
}