(i int)
| 194 | } |
| 195 | |
| 196 | func (node *BTreeNode[T]) DeleteIthKey(i int) { |
| 197 | if i >= node.numKeys { |
| 198 | panic("deleting out of bounds key") |
| 199 | } |
| 200 | for j := i; j < node.numKeys-1; j++ { |
| 201 | node.keys[j] = node.keys[j+1] |
| 202 | node.children[j+1] = node.children[j+2] |
| 203 | } |
| 204 | node.numKeys-- |
| 205 | } |
| 206 | |
| 207 | // Transform: |
| 208 | // |