把左子树和右子树视为分开的两颗树,
值相同则继续比较
比较左子树的左子树和右子树的右子树,左子树的右子树和右子树的左子树
不同则返回false
/**
* 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 isSymmetric(TreeNode* root) {
if(root == NULL)
return true;
else
return isTrueSymmetric(root->left,root->right);
}
bool isTrueSymmetric(TreeNode *pleft,TreeNode *pright)
{
if(pleft == NULL || pright == NULL)
{
if(pleft == NULL && pright == NULL)
return true;
else return false;
}
if(pleft->val == pright->val)
return isTrueSymmetric(pleft->left,pright->right)&&isTrueSymmetric(pleft->right,pright->left);
else return false;
}
};