Update Flip Equivalent Binary Trees.java

varunu28 · web-flow · commit 2dea3e54c58e · 2024-10-24T07:18:31.000-07:00
diff --git a/Medium/Flip Equivalent Binary Trees.java b/Medium/Flip Equivalent Binary Trees.java
@@ -1,31 +1,31 @@
-i/**
+/**
  * Definition for a binary tree node.
  * public class TreeNode {
  *     int val;
  *     TreeNode left;
  *     TreeNode right;
- *     TreeNode(int x) { val = x; }
+ *     TreeNode() {}
+ *     TreeNode(int val) { this.val = val; }
+ *     TreeNode(int val, TreeNode left, TreeNode right) {
+ *         this.val = val;
+ *         this.left = left;
+ *         this.right = right;
+ *     }
  * }
  */
 class Solution {
-  public boolean flipEquiv(TreeNode root1, TreeNode root2) {
-    if (root1 == null && root2 == null) {
-      return true;
+    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;
+        }
+        boolean noSwap = flipEquiv(root1.left, root2.left) && flipEquiv(root1.right, root2.right);
+        boolean swap = flipEquiv(root1.left, root2.right) && flipEquiv(root1.right, root2.left);
+        return noSwap || swap;
     }
-    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)
-        )
-      );
-  }
 }
