判别树的同构

package tree_test;
import java.util.List;
import java.util.ArrayList;
import java.util.Scanner;

public class lsomorphic {

	public static class TreeNode{
		char element;
		int left;
		int right;
		TreeNode(char element,int left,int right)
		{
			this.element=element;
			this.left=left;
			this.right=right;
		}
	};
	
	@SuppressWarnings("null")
	public static int  BuildTree(List<TreeNode> t1) throws Exception {
		@SuppressWarnings("resource")
		Scanner scanner = new Scanner(System.in);	
		
		int n=scanner.nextInt();		//总个数
		int[] check=new int[n+1];		//标志位check
		int i;
		
		if(n!=0) {
			for(i=0;i<=n;i++)check[i]=0;
			
			for(i=0;i<n;i++) {           //每行输入数据
				String m=scanner.next();
				char element=m.charAt(0);
				char cl=m.charAt(1);
				char cr=m.charAt(2);
				TreeNode e =  new TreeNode(element,-1,-1);	//建立一个TreeNode
				t1.add(e);