题解 | #对称的二叉树#
对称的二叉树
https://www.nowcoder.com/practice/ff05d44dfdb04e1d83bdbdab320efbcb
class Solution {
public:
bool isSymmetrical(TreeNode* root1,TreeNode* root2){
if(root1==NULL&&root2==NULL)
return true;
if(root1==NULL||root2==NULL||root1->val!=root2->val)
return false;
return isSymmetrical(root1->left,root2->right)&&isSymmetrical(root1->right,root2->left);
}
bool isSymmetrical(TreeNode* pRoot) {
return isSymmetrical(pRoot,pRoot);
}
};
递归解决
