递归
class Solusion{
public boolean isSymmetric(TreeNode root){
return check(root,root);
}
public boolean check(TreeNode p,TreeNode q){
if(p==null && q==null){
return tree;
}
else if(p==null || q==null){
return false;
}
else
return p.val == q.val && check(p.left,q.right) && check(p.right,q.left);
}
}