code: func (ptree *ptree) Delete(keys ...common.Comparator) {
  	ra := newRemoveAction(keys)
  	ptree.checkAndRun(ra)
  	ra.completer.Wait()
  }
docs: // Delete will remove the provided keys from the tree.  If no
  // matching key is found, this is a no-op.