1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14

	boolean recursion(TreeNode root1, TreeNode root2){
		if(root1==null&&root2==null){
			return true;
		}

		if(root1==null||root2==null||root1.val!=root2.val){
			return false;
		}

		return recursion(root1.left, root2.right)&&recursion(root1.right, root2.left);
	}
	public boolean isSymmetrical (TreeNode pRoot) {
        return recursion(pRoot, pRoot);
    }