code: func (rt *skipListRT) Delete(entries ...rangetree.Entry) rangetree.Entries {
  	deletedEntries := make(rangetree.Entries, len(entries))
  	for i, e := range entries {
  		deletedEntries[i] = rt.delete(e)
  	}
  
  	return deletedEntries
  }
docs: // Delete will remove the provided entries from the tree.
  // Any entries that were deleted will be returned in the order in
  // which they were deleted.  If an entry does not exist to be deleted,
  // a nil is returned for that entry's index in the provided cells.