add 951

Author: luliyucoordinate

src/0951-Flip-Equivalent-Binary-Trees/0951.cpp

@@ -0,0 +1,12 @@
+static int x = [](){std::ios::sync_with_stdio(false);cin.tie(0);return 0;}();
+class Solution 
+{
+public:
+    bool flipEquiv(TreeNode* root1, TreeNode* root2) 
+    {
+        if (root1 == nullptr or root2 == nullptr) return root1 == root2;
+        if (root1->val != root2->val) return false;
+        return (flipEquiv(root1->left, root2->left) and flipEquiv(root1->right, root2->right)) or
+            (flipEquiv(root1->left, root2->right) and flipEquiv(root1->right, root2->left));
+    }
+};

src/0951-Flip-Equivalent-Binary-Trees/0951.py

@@ -0,0 +1,15 @@
+class Solution:
+    def flipEquiv(self, root1, root2):
+        """
+        :type root1: TreeNode
+        :type root2: TreeNode
+        :rtype: bool
+        """
+        if root1 == None or root2 == None:
+            return root1 == root2
+        
+        if root1.val != root2.val:
+            return False
+        
+        return (self.flipEquiv(root1.left, root2.left) and self.flipEquiv(root1.right, root2.right)) or\
+               (self.flipEquiv(root1.left, root2.right) and self.flipEquiv(root1.right, root2.left))