Time: 0 ms (100%), Space: 14.5 MB (84.24%) - LeetHub

Author: MishkatIT

0951-flip-equivalent-binary-trees/0951-flip-equivalent-binary-trees.cpp

@@ -0,0 +1,22 @@
+/**
+ * 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 {
+public:
+    bool flipEquiv(TreeNode* root1, TreeNode* root2) {
+        if (!root1 && !root2) return true;
+        if (!root1 || !root2) return false;
+        if (root1->val != root2->val) return false;
+        bool ok = flipEquiv(root1->left, root2->left) && flipEquiv(root1->right, root2->right);
+        if (ok) return true;
+        return flipEquiv(root1->left, root2->right) && flipEquiv(root1->right, root2->left);
+    }
+};