feat: add solutions to lc problem: No.0951

solution/0900-0999/0951.Flip Equivalent Binary Trees/README.md

@@ -182,6 +182,34 @@ func flipEquiv(root1 *TreeNode, root2 *TreeNode) bool {
 }
 ```
 
+#### TypeScript
+
+```ts
+function flipEquiv(root1: TreeNode | null, root2: TreeNode | null): boolean {
+    if (root1 === root2) return true;
+    if (!root1 || !root2 || root1?.val !== root2?.val) return false;
+
+    const { left: l1, right: r1 } = root1!;
+    const { left: l2, right: r2 } = root2!;
+
+    return (flipEquiv(l1, l2) && flipEquiv(r1, r2)) || (flipEquiv(l1, r2) && flipEquiv(r1, l2));
+}
+```
+
+#### JavaScript
+
+```js
+function flipEquiv(root1, root2) {
+    if (root1 === root2) return true;
+    if (!root1 || !root2 || root1?.val !== root2?.val) return false;
+
+    const { left: l1, right: r1 } = root1;
+    const { left: l2, right: r2 } = root2;
+
+    return (flipEquiv(l1, l2) && flipEquiv(r1, r2)) || (flipEquiv(l1, r2) && flipEquiv(r1, l2));
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0900-0999/0951.Flip Equivalent Binary Trees/README_EN.md

@@ -178,6 +178,34 @@ func flipEquiv(root1 *TreeNode, root2 *TreeNode) bool {
 }
 ```
 
+#### TypeScript
+
+```ts
+function flipEquiv(root1: TreeNode | null, root2: TreeNode | null): boolean {
+    if (root1 === root2) return true;
+    if (!root1 || !root2 || root1?.val !== root2?.val) return false;
+
+    const { left: l1, right: r1 } = root1!;
+    const { left: l2, right: r2 } = root2!;
+
+    return (flipEquiv(l1, l2) && flipEquiv(r1, r2)) || (flipEquiv(l1, r2) && flipEquiv(r1, l2));
+}
+```
+
+#### JavaScript
+
+```js
+function flipEquiv(root1, root2) {
+    if (root1 === root2) return true;
+    if (!root1 || !root2 || root1?.val !== root2?.val) return false;
+
+    const { left: l1, right: r1 } = root1;
+    const { left: l2, right: r2 } = root2;
+
+    return (flipEquiv(l1, l2) && flipEquiv(r1, r2)) || (flipEquiv(l1, r2) && flipEquiv(r1, l2));
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0900-0999/0951.Flip Equivalent Binary Trees/Solution.js

@@ -0,0 +1,9 @@
+function flipEquiv(root1, root2) {
+    if (root1 === root2) return true;
+    if (!root1 || !root2 || root1?.val !== root2?.val) return false;
+
+    const { left: l1, right: r1 } = root1;
+    const { left: l2, right: r2 } = root2;
+
+    return (flipEquiv(l1, l2) && flipEquiv(r1, r2)) || (flipEquiv(l1, r2) && flipEquiv(r1, l2));
+}

solution/0900-0999/0951.Flip Equivalent Binary Trees/Solution.ts

@@ -0,0 +1,9 @@
+function flipEquiv(root1: TreeNode | null, root2: TreeNode | null): boolean {
+    if (root1 === root2) return true;
+    if (!root1 || !root2 || root1?.val !== root2?.val) return false;
+
+    const { left: l1, right: r1 } = root1!;
+    const { left: l2, right: r2 } = root2!;
+
+    return (flipEquiv(l1, l2) && flipEquiv(r1, r2)) || (flipEquiv(l1, r2) && flipEquiv(r1, l2));
+}