Add solution #701

Author: JoshCrozier

README.md

@@ -89,6 +89,7 @@
 648|[Replace Words](./0648-replace-words.js)|Medium|
 653|[Two Sum IV - Input is a BST](./0653-two-sum-iv---input-is-a-bst.js)|Easy|
 686|[Repeated String Match](./0686-repeated-string-match.js)|Easy|
+701|[Insert into a Binary Search Tree](./0701-insert-into-a-binary-search-tree.js)|Medium|
 713|[Subarray Product Less Than K](./0713-subarray-product-less-than-k.js)|Medium|
 722|[Remove Comments](./0722-remove-comments.js)|Medium|
 739|[Daily Temperatures](./0739-daily-temperatures.js)|Medium|

solutions/0701-insert-into-a-binary-search-tree.js

@@ -0,0 +1,41 @@
+/**
+ * 701. Insert into a Binary Search Tree
+ * https://leetcode.com/problems/insert-into-a-binary-search-tree/
+ * Difficulty: Medium
+ *
+ * You are given the root node of a binary search tree (BST) and a value
+ * to insert into the tree. Return the root node of the BST after the
+ * insertion. It is guaranteed that the new value does not exist in the
+ * original BST.
+ *
+ * Notice that there may exist multiple valid ways for the insertion,
+ * as long as the tree remains a BST after insertion. You can return
+ * any of them.
+ */
+
+/**
+ * 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
+ * @param {number} val
+ * @return {TreeNode}
+ */
+var insertIntoBST = function(root, val) {
+  if (!root) {
+    return new TreeNode(val);
+  }
+
+  if (val > root.val) {
+    root.right = insertIntoBST(root.right, val);
+  } else {
+    root.left = insertIntoBST(root.left, val);
+  }
+
+  return root;
+};