Push a chain of Node's into the Red-Black Tree
(keys ...T)
| 70 | |
| 71 | // Push a chain of Node's into the Red-Black Tree |
| 72 | func (t *RB[T]) Push(keys ...T) { |
| 73 | for _, key := range keys { |
| 74 | t.pushHelper(t.Root, key) |
| 75 | } |
| 76 | } |
| 77 | |
| 78 | // Delete a node of Red-Black Tree |
| 79 | // Returns false if the node does not exist, otherwise returns true. |
nothing calls this directly
no test coverage detected