code: public List<Node<K, V>> stab(K k) {
        Interval<K> i = new Interval<K>(k, true, k, true);
        final List<Node<K, V>> nodes = new ArrayList<Node<K, V>>();
        findOverlap(root.left, i, new NodeCallback<K, V>() {
           @Override
           public void handle(Node<K, V> node) {
              nodes.add(node);
           }
        });
        return nodes;
     }
docs: Find all Intervals that contain a given value.
  
  @param k the value to search for
  @return a non-null List of intervals that contain the value