现任意给定一颗二叉树，求这颗二叉树上所有 “X结点” 的个数。

1. 对于二叉树上的一个结点，若他的左子树和右子树完全相同（包括值和结构），
则我们将他称为 “X结点”。
现任意给定一颗二叉树，求这颗二叉树上所有 “X结点” 的个数。
 

//定义一颗二叉树
public class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;
    TreeNode(int x) { val = x; }
}

public class CalNode {

    public static boolean isSameRec(TreeNode r1, TreeNode r2) {

        if (r1 == null && r2 == null) {
            return true;
        }

        else if (r1 == null || r2 == null) {
            return false;
        }

        if (r1.val != r2.val) {
            return false;
        }
        boolean leftRes = isSameRec(r1.left, r2.left);
        boolean rightRes = isSameRec(r1.right, r2.right);
        return leftRes && rightRes;
    }


    public static int getNodeNum(TreeNode root) {
        if(root == null || root.left == null || root.right == null){
            return 0;
        }
        int count = 0;

        if( CalNode.isSameRec(root.left,root.right)){
            ++count;
        }
        return count + getNodeNum(root.left)+getNodeNum(root.right);
    }

    public static void main(String[] args) {
        TreeNode r1 = new TreeNode(1);
        TreeNode r2 = new TreeNode(2);
        TreeNode r3 = new TreeNode(2);
        TreeNode r4 = new TreeNode(4);
        TreeNode r5 = new TreeNode(4);
        TreeNode r6 = new TreeNode(4);
        TreeNode r7 = new TreeNode(4);

        r1.left = r2;
        r1.right = r3;
        r2.left = r4;
        r2.right = r5;
        r3.right = r6;
        r3.left = r7;

        int total = CalNode.getNodeNum(r1);
        System.out.println(total);
    }
}