MCPcopy
hub / github.com/TheAlgorithms/Go / Delete

Method Delete

structure/tree/example_test.go:13–13  ·  view source on GitHub ↗
(T)

Source from the content-addressed store, hash-verified

11type TestTree[T constraints.Ordered] interface {
12 Push(...T)
13 Delete(T) bool
14 Get(T) (bt.Node[T], bool)
15 Empty() bool
16 Has(T) bool

Callers 15

TestRBTreeDeleteFunction · 0.65
TestRBTreeFunction · 0.65
TestRBTreeStringFunction · 0.65
TestDeleteFunction · 0.65
TestBTreeIncreasingFunction · 0.65
TestBTreeDecreasingFunction · 0.65
TestBTreeRandomFunction · 0.65
TestBTreeDeleteEverythingFunction · 0.65
TestBinarySearchFunction · 0.65
TestAVLFunction · 0.65
TestTreePredecessorAndSuccessorFunction · 0.65
BenchmarkBSTree_DeleteFunction · 0.65

Calls

no outgoing calls

Tested by 15

TestRBTreeDeleteFunction · 0.52
TestRBTreeFunction · 0.52
TestRBTreeStringFunction · 0.52
TestDeleteFunction · 0.52
TestBTreeIncreasingFunction · 0.52
TestBTreeDecreasingFunction · 0.52
TestBTreeRandomFunction · 0.52
TestBTreeDeleteEverythingFunction · 0.52
TestBinarySearchFunction · 0.52
TestAVLFunction · 0.52
TestTreePredecessorAndSuccessorFunction · 0.52
BenchmarkBSTree_DeleteFunction · 0.52