对称的二叉树:
下面是我在牛客网oj环境下编译通过的:
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};
*/
class Solution {
public:
bool isSymmetrical(TreeNode* pRoot)
{
return isSymmetrical(pRoot,pRoot);
}
bool isSymmetrical(TreeNode* pRoot1,TreeNode* pRoot2)
{
if(pRoot1==NULL&&pRoot2==NULL)
{
return true;
}
if(pRoot1==NULL||pRoot2==NULL)
{
return false;
}
if(pRoot1->val!=pRoot2->val)
{
return false;
}
return (isSymmetrical(pRoot1->left,pRoot2->right)&&
isSymmetrical(pRoot1->right,pRoot2->left));
}
};