Added 1 solution

Author: varunu28

Medium/Flip Equivalent Binary Trees.java

@@ -0,0 +1,31 @@
+i/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode(int x) { val = x; }
+ * }
+ */
+class Solution {
+  public boolean flipEquiv(TreeNode root1, TreeNode root2) {
+    if (root1 == null && root2 == null) {
+      return true;
+    }
+    if (root1 == null || root2 == null) {
+      return false;
+    }
+    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)
+        )
+      );
+  }
+}