## Description

Delete will remove the provided keys from the tree. If no matching key is found, this is a no-op.

## Examples

tree.Insert(m1) tree.Delete(m1) assert.Equal(t, uint64(0), tree.Len()) assert.Equal(t, common.Comparators{nil}, tree.Get(m1))

tree.Insert(m1, m2) tree.Delete(m1, m2) assert.Equal(t, uint64(0), tree.Len()) assert.Equal(t, common.Comparators{nil, nil}, tree.Get(m1, m2))

assert.Equal(t, uint64(100), tree.Len()) tree.Delete(reversed...) assert.Equal(t, uint64(0), tree.Len()) for _, k := range reversed {

## Delete is referenced in 1 repository

**github.com/Workiva/go-datastructures**

- 7 references in btree/palm/tree_test.go