题目:
代码:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
/*class Solution {//my answer
public:
bool flipEquiv(TreeNode* root1, TreeNode* root2) {
if(root1==NULL&&root2==NULL) return true;
else if(root1==NULL||root2==NULL) return false;
if(root1->val!=root2->val) return false;
if(root1->left==NULL){
if(root1->right==NULL){
if(root2->left==NULL&&root2->right==NULL){
return true;
}
else return false;
}
else{
if(root2->left==NULL){
return flipEquiv(root1->right,root2->right);
}
else{
return flipEquiv(root1->right,root2->left)&&flipEquiv(root1->left,root2->right);
}
}
}
else{
if(root1->right==NULL){
if(root2->left==NULL){
return flipEquiv(root1->left,root2->right);
}
else{
return flipEquiv(root1->left,root2->left)&&flipEquiv(root1->right,root2->right);
}
}
else{
if(root2->left==NULL||root2->right==NULL) return false;
else{
if(root1->left->val==root2->left->val){
return flipEquiv(root1->left,root2->left)&&flipEquiv(root1->right,root2->right);
}
else return flipEquiv(root1->left,root2->right)&&flipEquiv(root1->right,root2->left);
}
}
}
return true;
}
};*/
class Solution {//best answer
public:
bool flipEquiv(TreeNode* root1, TreeNode* root2) {
if(!root1&&!root2) return true;
else if(!root1||!root2) return false;
else if(root1->val!=root2->val) return false;
return flipEquiv(root1->left,root2->left)
&&flipEquiv(root1->right,root2->right)
||flipEquiv(root1->left,root2->right)
&&flipEquiv(root1->right,root2->left);
}
};
运行结果: