Add solution #700

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|
+700|[Search in a Binary Search Tree](./0700-search-in-a-binary-search-tree.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|

solutions/0700-search-in-a-binary-search-tree.js

@@ -0,0 +1,34 @@
+/**
+ * 700. Search in a Binary Search Tree
+ * https://leetcode.com/problems/search-in-a-binary-search-tree/
+ * Difficulty: Easy
+ *
+ * You are given the root of a binary search tree (BST) and an integer val.
+ *
+ * Find the node in the BST that the node's value equals val and return the
+ * subtree rooted with that node. If such a node does not exist, return null.
+ */
+
+/**
+ * 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 searchBST = function(root, val) {
+  while (root) {
+    if (root.val === val) {
+      return root;
+    }
+    root = root.val > val ? root.left : root.right;
+  }
+
+  return null;
+};