her. It is
referenced a lot, so I am wondering where everyone is finding it.
Thanks!
Trevor
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to algogeeks+unsubscr...@googlegroups.com.
Maximum no. of nodes in a B-tree : ∑ from i=0 to h-1 of (n+1)^i = 1/n * (
(n+1)^h -1). This is the case as, each node can have a max. of n keys, then
it will have a max. of n+1 children. So then summing up the max. no. of
children from the root till the level h-1, gives the total no. of nodes
possi
