/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public boolean isSymmetric(TreeNode root) {
if(root==null) return true;
return check(root.left,root.right);
}
public boolean check(TreeNode p,TreeNode q){
if(p==null&q==null) return true;
if(p==null||q==null) return false;
if(p.val!=q.val) return false;
else{
boolean m=check(p.left,q.right);
boolean n=check(p.right,q.left);
return m&&n;
}
}
}