package 期末算法设计;
import java.awt.List;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
public class binaryTree {
Scanner write = new Scanner(System.in);
class Node{
int data;
Node l;
Node r;
}
Node root = new Node() ;
public void creatBTree(Node rootNode){
int a;
a=write.nextInt();
rootNode.data=a;
if(a!=-1){
Node l = new Node();
Node r = new Node();
rootNode.l=l;
rootNode.r=r;
creatBTree(l);
creatBTree(r);
}
}
public void levelTravel(Node rootNode){
LinkedList q = new LinkedList<>();
}
public static void main(String[] args){
binaryTree bt = new binaryTree();
bt.creatBTree(bt.root);
bt.levelTravel(bt.root);
}
}