feat: add javascript solution to lc problem: No.0099 (doocs#694)

ovyas24 · web-flow · commit f3483c44af8f · 2022-01-29T15:47:26.000+08:00
diff --git a/solution/0000-0099/0099.Recover Binary Search Tree/README.md b/solution/0000-0099/0099.Recover Binary Search Tree/README.md
@@ -252,6 +252,52 @@ public class Solution {
 }
 ```
 
+### **JavaScript**
+
+```javascript
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @return {void} Do not return anything, modify root in-place instead.
+ */
+const recoverTree = root => {
+    const data = {
+      prev: null,
+      first: null,
+      second: null
+    };
+    let tmp = 0;
+  
+    helper(root, data);
+  
+    tmp = data.first.val;
+    data.first.val = data.second.val;
+    data.second.val = tmp;
+};
+  
+const helper = (root, data) => {
+    if (!root) return;
+
+    helper(root.left, data);
+
+    if (data.prev && data.prev.val >= root.val) {
+        if (!data.first) data.first = data.prev;
+        data.second = root;
+    }
+
+    data.prev = root;
+
+    helper(root.right, data);
+};
+```
+
 ### **...**
 
 ```
diff --git a/solution/0000-0099/0099.Recover Binary Search Tree/README_EN.md b/solution/0000-0099/0099.Recover Binary Search Tree/README_EN.md
@@ -243,6 +243,52 @@ public class Solution {
 }
 ```
 
+### **JavaScript**
+
+```javascript
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @return {void} Do not return anything, modify root in-place instead.
+ */
+const recoverTree = root => {
+    const data = {
+      prev: null,
+      first: null,
+      second: null
+    };
+    let tmp = 0;
+  
+    helper(root, data);
+  
+    tmp = data.first.val;
+    data.first.val = data.second.val;
+    data.second.val = tmp;
+};
+  
+const helper = (root, data) => {
+    if (!root) return;
+
+    helper(root.left, data);
+
+    if (data.prev && data.prev.val >= root.val) {
+        if (!data.first) data.first = data.prev;
+        data.second = root;
+    }
+
+    data.prev = root;
+
+    helper(root.right, data);
+};
+```
+
 ### **...**
 
 ```
diff --git a/solution/0000-0099/0099.Recover Binary Search Tree/Solution.js b/solution/0000-0099/0099.Recover Binary Search Tree/Solution.js
@@ -0,0 +1,41 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @return {void} Do not return anything, modify root in-place instead.
+ */
+const recoverTree = root => {
+    const data = {
+      prev: null,
+      first: null,
+      second: null
+    };
+    let tmp = 0;
+  
+    helper(root, data);
+  
+    tmp = data.first.val;
+    data.first.val = data.second.val;
+    data.second.val = tmp;
+};
+  
+const helper = (root, data) => {
+    if (!root) return;
+
+    helper(root.left, data);
+
+    if (data.prev && data.prev.val >= root.val) {
+        if (!data.first) data.first = data.prev;
+        data.second = root;
+    }
+
+    data.prev = root;
+
+    helper(root.right, data);
+};
