(key T)
| 72 | } |
| 73 | |
| 74 | func (tree *BTree[T]) Search(key T) bool { |
| 75 | if tree.root == nil { |
| 76 | return false |
| 77 | } |
| 78 | return tree.root.Search(key) |
| 79 | } |
| 80 | |
| 81 | func (node *BTreeNode[T]) InsertKeyChild(key T, child *BTreeNode[T]) { |
| 82 | i := node.numKeys |
no outgoing calls