searches a binary search tree for a range of values (see my arrayToBST class for testing)

BST_range_search.js

function rangeSearchBST(bst, min, max){
  var list = [];
  function searchTree(bst, min, max){
    if (bst){
      searchTree(bst.left, min, max);
      if (min<bst.value & bst.value<max){
        list.push(bst.value);
      }
      searchTree(bst.right, min, max);
    }
    return list;
  }
  return searchTree(bst, min, max);
}

rangeSearchBST(arrayToBST(test), 1, 5);