Push a chain of Node's into the BinarySearch
(keys ...T)
| 57 | |
| 58 | // Push a chain of Node's into the BinarySearch |
| 59 | func (t *BinarySearch[T]) Push(keys ...T) { |
| 60 | for _, key := range keys { |
| 61 | t.pushHelper(t.Root, key) |
| 62 | } |
| 63 | } |
| 64 | |
| 65 | // Delete removes the node of val |
| 66 | func (t *BinarySearch[T]) Delete(val T) bool { |
nothing calls this directly
no test coverage detected