基础题,就是一个普通的Level Order Traversal
import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.util.LinkedList;
import java.util.Scanner;
public class S23 {
static int loop = 0;
public static void main(String[] args) throws FileNotFoundException {
BufferedInputStream in = new BufferedInputStream(new FileInputStream("in.in"));
System.setIn(in);
Scanner cin = new Scanner(System.in);
while (cin.hasNextInt()) {
int n = cin.nextInt();
loop = n;
int[] tmp = new int[n];
for(int i=0; i<n; i++){
tmp[i] = cin.nextInt();
}
// System.out.println(Arrays.toString(tmp));
if(n == 0){
System.out.println("NULL");
continue;
}
cin.nextLine();
TreeNode[] tree = new TreeNode[n];
for(int i=0; i<n; i++){
String s = cin.nextLine();
//System.out.println(s);
String[] ss = s.split(" ");
if(tree[i] == null){ // 特别注意这里!当且仅当为空时才需要赋值!
tree[i] = new TreeNode(tmp[i]);
}
if(ss[0].equals("d")){
int left = Integer.parseInt(ss[1]);
int right = Integer.parseInt(ss[2]);
if(tree[left-1]==null)
tree[left-1] = new TreeNode(tmp[left-1]);
if(tree[right-1]==null)
tree[right-1] = new TreeNode(tmp[right-1]);
tree[i].left = tree[left-1];
tree[i].right = tree[right-1];
}else if(ss[0].equals("l")){
int left = Integer.parseInt(ss[1]);
tree[left-1] = new TreeNode(tmp[left-1]);
tree[i].left = tree[left-1];
}else if(ss[0].equals("r")){
int right = Integer.parseInt(ss[1]);
tree[right-1] = new TreeNode(tmp[right-1]);
tree[i].right = tree[right-1];
}else if(ss[0].equals("z")){
}
}
printTree(tree[0]);
System.out.println();
}
}
public static void printTree(TreeNode root){
LinkedList<TreeNode> queue = new LinkedList<TreeNode>();
queue.add(root);
while(!queue.isEmpty()){
TreeNode cur = queue.remove();
if(loop != 1){
System.out.print(cur.val + " ");
}else{
System.out.print(cur.val);
}
loop--;
if(cur.left != null){
queue.add(cur.left);
}
if(cur.right != null){
queue.add(cur.right);
}
}
}
public static class TreeNode{
int val;
TreeNode left, right;
public TreeNode(int val_){
val = val_;
}
}
}