MCPcopy Create free account
hub / github.com/TheAlgorithms/Go / minKeys

Function minKeys

structure/tree/btree.go:20–22  ·  view source on GitHub ↗
(maxKeys int)

Source from the content-addressed store, hash-verified

18}
19
20func minKeys(maxKeys int) int {
21 return (maxKeys - 1) / 2
22}
23
24func NewBTreeNode[T constraints.Ordered](maxKeys int, isLeaf bool) *BTreeNode[T] {
25 if maxKeys <= 0 {

Callers 2

VerifyMethod · 0.85
DeleteMethod · 0.85

Calls

no outgoing calls

Tested by

no test coverage detected