data structures - Number of nodes in a B tree -
data structures - Number of nodes in a B tree -
in b tree minimum grade t, each non leaf node other root has @ to the lowest degree t children , @ 2*t children. suppose keys {1,2,3...,n} inserted empty b tree minimum grade 2 in sequence 1,2,3.....,n. how many nodes final b tree have?
from have understood, sense n/t since minimum number of keys each node can have k, , total number of keys n. correct?? if not tell me going wrong , how should this?
the reply (n-2)*log(n-2)
t=2
data-structures b-tree
Comments
Post a Comment