Java 二叉树的创建和遍历

题目描述
给出一个n个节点的二叉树，请求出二叉树的前序遍历，中序遍历和后序遍历。

输入
第一位一个整数n(0<n<=26)，表示二叉树有n个节点，以下n行，每行第一个为一个大写字母表示节点，后面为两整数，第一个表示左儿子序号，第二个表示右儿子序号，如果该序号为0表示没有

输出
共三行，第一行为二叉树的前序遍历，第二行为中序遍历，第三行为后序遍历

样例输入
7
F 2 3
C 4 5
E 0 6
A 0 0
D 7 0
G 0 0
B 0 0

样例输出
FCADBEG
ACBDFEG
ABDCGEF

public class Test1 {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int len = scanner.nextInt();
		char[][] inputs = new char[len][3];
		for(int i=0;i<len;i++) {
			for(int j=0;j<3;j++) {
				inputs[i][j] = scanner.next().charAt(0);
			}
		}
		TreeNode root = new TreeNode(inputs[0][0]);
		root.l = inputs[0][1]-'0';
		root.r = inputs[0][2]-'0';
		TreeNode now = root;
		Queue<TreeNode> queue = new LinkedList<>();
		queue.offer(now);
		while(!queue.isEmpty()) {
			int size = queue.size();
			for(int i=0;i<size;i++) {
				now = queue.poll();
				if(now.l!=0) {
					now.left = new TreeNode(inputs[now.l-1][0]);
					now.left.l = inputs[now.l-1][1]-'0';
					now.left.r = inputs[now.l-1][2]-'0';
					queue.offer(now.left);
				}
				if(now.r!=0) {
					now.right = new TreeNode(inputs[now.r-1][0]);
					now.right.l = inputs[now.r-1][1]-'0';
					now.right.r = inputs[now.r-1][2]-'0';
					queue.offer(now.right);
				}
			}
		}
		
		preBackTrace(root);
		System.out.println();
		
		zhongBackTrace(root);
		System.out.println();
		
		afterBackTrace(root);
		
	}

	private static void preBackTrace(TreeNode root) {
		// TODO Auto-generated method stub
		if(root==null) {
			return;
		}
		System.out.print(root.val);
		preBackTrace(root.left);
		preBackTrace(root.right);
	}
	
	private static void zhongBackTrace(TreeNode root) {
		// TODO Auto-generated method stub
		if(root==null) {
			return;
		}
		zhongBackTrace(root.left);
		System.out.print(root.val);
		zhongBackTrace(root.right);
	}
	
	private static void afterBackTrace(TreeNode root) {
		// TODO Auto-generated method stub
		if(root==null) {
			return;
		}
		afterBackTrace(root.left);
		afterBackTrace(root.right);
		System.out.print(root.val);
	}
	
	
}
class TreeNode{
	char val;
	int l;
	int r;
	TreeNode left;
	TreeNode right;
	public TreeNode(char val) {
		this.val = val;
	}
}