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->right, pRoot2->left)
&& issymmetrical(pRoot1->left, pRoot2->right);
}