6.12 相同的树——【LeetCode】

public class test {

    public boolean isSameTree(TreeNode p, TreeNode q) {
        boolean compare = compare(p, q);
        return compare;
    }

    public boolean compare(TreeNode tree1, TreeNode tree2){
        if(tree1==null && tree2==null){
            return true;
        }
        if(tree1==null || tree2==null){
            return false;
        }
        if(tree1.val != tree2.val){
            return false;
        }

        boolean compareLeft = compare(tree1.left, tree2.left);
        boolean compareRight = compare(tree1.right, tree2.right);
        return compareLeft && compareRight;
    }
}

class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;
    TreeNode() {}
    TreeNode(int val) { this.val = val; }
    TreeNode(int val, TreeNode left, TreeNode right) {
        this.val = val;
        this.left = left;
        this.right = right;
    }
}