code: public Node<K, V> remove(Interval1D<K> interval) {
      Node<K, V> node = get(interval);
      root = remove(root, interval);
      return node;
    }
docs: Remove and return value associated with given interval.
  
  @return null, if this interval does not exist in the tree