Add js solution to leetcode problem: no.285

tchx626 · tchx626 · commit 316af28759a6 · 2021-07-17T21:29:27.000+08:00
diff --git a/solution/0200-0299/0285.Inorder Successor in BST/README.md b/solution/0200-0299/0285.Inorder Successor in BST/README.md
@@ -64,6 +64,52 @@
 ```java
 
 ```
+### **JavaScript**
+
+```js
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val) {
+ *     this.val = val;
+ *     this.left = this.right = null;
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @param {TreeNode} p
+ * @return {TreeNode}
+ */
+var inorderSuccessor = function (root, p) {
+    function findMin(root) {
+        if (!root) {
+            return null;
+        }
+        while (root.left) {
+            root = root.left;
+        }
+        return root;
+    }
+    if (!root) {
+        return null;
+    }
+    let successor = null;
+    while (root) {
+        if (root.val > p.val) {
+            successor = root;
+            root = root.left;
+        } else if (root.val < p.val) {
+            root = root.right;
+        } else {
+            if (root.right) {
+                successor = findMin(root.right);
+            }
+            break;
+        }
+    }
+    return successor;
+};
+```
+
 
 ### **...**
 
diff --git a/solution/0200-0299/0285.Inorder Successor in BST/README_EN.md b/solution/0200-0299/0285.Inorder Successor in BST/README_EN.md
@@ -51,6 +51,52 @@
 
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val) {
+ *     this.val = val;
+ *     this.left = this.right = null;
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @param {TreeNode} p
+ * @return {TreeNode}
+ */
+var inorderSuccessor = function (root, p) {
+    function findMin(root) {
+        if (!root) {
+            return null;
+        }
+        while (root.left) {
+            root = root.left;
+        }
+        return root;
+    }
+    if (!root) {
+        return null;
+    }
+    let successor = null;
+    while (root) {
+        if (root.val > p.val) {
+            successor = root;
+            root = root.left;
+        } else if (root.val < p.val) {
+            root = root.right;
+        } else {
+            if (root.right) {
+                successor = findMin(root.right);
+            }
+            break;
+        }
+    }
+    return successor;
+};
+```
+
 ### **...**
 
 ```
diff --git a/solution/0200-0299/0285.Inorder Successor in BST/Solution.js b/solution/0200-0299/0285.Inorder Successor in BST/Solution.js
@@ -0,0 +1,41 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val) {
+ *     this.val = val;
+ *     this.left = this.right = null;
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @param {TreeNode} p
+ * @return {TreeNode}
+ */
+var inorderSuccessor = function (root, p) {
+	function findMin(root) {
+		if (!root) {
+			return null;
+		}
+		while (root.left) {
+			root = root.left;
+		}
+		return root;
+	}
+	if (!root) {
+		return null;
+	}
+	let successor = null;
+	while (root) {
+		if (root.val > p.val) {
+			successor = root;
+			root = root.left;
+		} else if (root.val < p.val) {
+			root = root.right;
+		} else {
+			if (root.right) {
+				successor = findMin(root.right);
+			}
+			break;
+		}
+	}
+	return successor;
+};
