PAT 树的同构 Java

给定两棵树T1和T2。如果T1可以通过若干次左右孩子互换就变成T2，则我们称两棵树是“同构”的。例如图1给出的两棵树就是同构的，因为我们把其中一棵树的结点A、B、G的左右孩子互换后，就得到另外一棵树。而图2就不是同构的。

现给定两棵树，请你判断它们是否是同构的。

输入格式:
输入给出2棵二叉树树的信息。对于每棵树，首先在一行中给出一个非负整数N (≤10)，即该树的结点数（此时假设结点从0到N−1编号）；随后N行，第i行对应编号第i个结点，给出该结点中存储的1个英文大写字母、其左孩子结点的编号、右孩子结点的编号。如果孩子结点为空，则在相应位置上给出“-”。给出的数据间用一个空格分隔。注意：题目保证每个结点中存储的字母是不同的。

输出格式:
如果两棵树是同构的，输出“Yes”，否则输出“No”。

import java.io.BufferedInputStream;
import java.util.Scanner;

public class Main {
    static TreeNode[] tree_1 = new TreeNode[100];
    static TreeNode[] tree_2 = new TreeNode[100];

    public static void main(String[] args) {
        Scanner scanner = new Scanner(new BufferedInputStream(System.in));
        System.out.println(isSomorphic(buildTree(scanner, tree_1), buildTree(scanner, tree_2))?
                "Yes":
                "No");
    }

    static int buildTree(Scanner scanner, TreeNode[] tree){
        int n = scanner.nextInt();
        int root = -1;
        for (int i=0; i<n; i++){
            tree[i] = new TreeNode(scanner.next(), scanner.next(), scanner.next());
        }
        for (int i=0; i<n; i++){
            if (isRoot(i, n, tree)){
                root = i;
                break;
            }
        }
        return root;
    }

    static boolean isRoot(int index, int n, TreeNode[] tree){
        boolean flag = true;
        for (int i=0; i<n; i++){
            TreeNode node = tree[i];
            if (node.right == index || node.left == index){
                flag = false;
                break;
            }
        }
        return flag;
    }

    static boolean isSomorphic(int t1, int t2){
        if (t1 == -1 && t2 == -1)
            return true;
        else if(t1 == -1 || t2 == -1)   //结合上一个判断，到此至少有一个树不为空，也就是说若有一个树为空则肯定不同构
            return false;
        else if(! tree_1[t1].name.equalsIgnoreCase(tree_2[t2].name))
            return false;
        else if(tree_1[t1].left == -1 && tree_2[t2].left == -1)
            return isSomorphic(tree_1[t1].right, tree_2[t2].right);
        else if(tree_1[t1].left != -1 && tree_2[t2].left != -1 && tree_1[tree_1[t1].left].name.equalsIgnoreCase(tree_2[tree_2[t2].left].name))
            return isSomorphic(tree_1[t1].left, tree_2[t2].left) && isSomorphic(tree_1[t1].right, tree_2[t2].right);
        else
            return isSomorphic(tree_1[t1].left, tree_2[t2].right) && isSomorphic(tree_1[t1].right, tree_2[t2].left);
    }
}

class TreeNode{
    public String name;
    public int left;
    public int right;

    TreeNode(String name, String left, String right) {
        this.name = name;
        this.left = Character.isDigit(left.charAt(0))? Integer.parseInt(left): -1;
        this.right = Character.isDigit(right.charAt(0))? Integer.parseInt(right): -1;
    }
}