给你一个二叉树的根节点 root
, 检查它是否轴对称
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
bool _isSymmetric(struct TreeNode* root1,struct TreeNode* root2) {
if(root1==NULL && root2==NULL)
{
return true;
}
if(root1==NULL || root2==NULL)
{
return false;
}
if(root1->val!=root2->val)
{
return false;
}
return _isSymmetric(root1->left,root2->right)
&& _isSymmetric(root1->right,root2->left);
}
bool isSymmetric(struct TreeNode* root) {
return _isSymmetric(root->left,root->right);
}