Troy Vasiga's definitions
A BTree of order d is a multi-way search tree such that
- every node has <= d children
- every non-root node has >= „¡d/2„¢
children
- all external Nodes have the same depth.
- every node has <= d children
- every non-root node has >= „¡d/2„¢
children
- all external Nodes have the same depth.
by Troy Vasiga July 25, 2004
Get the BTreemug. Hey did you see that loser, I bet he likes BTrees.
BTrees killed my son
Have you seen my leaf node???
BTrees killed my son
Have you seen my leaf node???
by Troy Vasiga July 25, 2004
Get the BTreemug.