判断左右子树是不是镜像的就成
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool ismirrorTree(TreeNode* p, TreeNode* q) {
if((p && !q)||(q && !p)) return false;
return (!p && !q) || (p->val==q->val && ismirrorTree(p->left,q->right) && ismirrorTree(p->right,q->left));
}
bool isSymmetric(TreeNode* root) {
return !root || ismirrorTree(root->left,root->right);
}
};