## Description

Delete will remove the provided entries from this AVL tree and return a new tree and any entries removed. If an entry could not be found, nil is returned in its place.

## Examples

i2, _ := i1.Insert(m1, m2, m3) i3, deleted := i2.Delete(m3) assert.Equal(t, Entries{m3}, deleted) assert.Equal(t, uint64(3), i2.Len())

assert.Equal(t, Entries{m1, m2, nil}, i3.Get(m1, m2, m3)) i4, deleted := i3.Delete(m2) assert.Equal(t, Entries{m2}, deleted) assert.Equal(t, uint64(2), i3.Len())

assert.Equal(t, Entries{m1, nil, nil}, i4.Get(m1, m2, m3)) i5, deleted := i4.Delete(m1) assert.Equal(t, Entries{m1}, deleted) assert.Equal(t, uint64(0), i5.Len())

## Delete is referenced in 1 repository

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

- 14 references in tree/avl/avl_test.go