code: public List<Node<K, V>> searchAll(Interval1D<K> interval) {
      LinkedList<Node<K, V>> list = new LinkedList<>();
      searchAll(root, interval, list);
      return list;
    }
docs: Return <b>ALL</b> intervals in data structure that intersect the given interval. Running time
  is proportional to R log N, where R is the number of intersections.
  
  @param interval the interval to search for
  @return all intersections. Single point intersections are also counted.