code: func (ot *orderedTree) Delete(entries ...Entry) Entries {
  	if len(entries) == 0 {
  		return nil
  	}
  
  	deletedEntries := make(Entries, len(entries))
  	for i, entry := range entries {
  		if entry == nil {
  			continue
  		}
  
  		deleted := ot.delete(entry)
  		if deleted != nil {
  			deletedEntries[i] = deleted.entry
  		}
  	}
  
  	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.