1
//====== Recursion ======
2
var searchBST = function (root, val) {
3
  if (!root) return null;
4
  if (root.val === val) return root;
5
  return searchBST(root.left, val) || searchBST(root.right, val);
6
};
7

8
//====== Iteration ======
9
var searchBST = function (root, val) {
10
  if (!root) return null;
11
  let node = root;
12

13
  while (node) {
14
    if (node.val === val) return node;
15
    else node = node.val > val ? node.left : node.right;
16
  }
17

18
  return node;
19
};