Related articles:
Binary search tree
Database
Key terms:
node
tree
elements
root
deleted
separator
leaf nodes
parent
sibling
subtree
internal node
insert
child nodes
number of elements
balanced
deficient node
legal node
separation values
minimum number of elements
new separator
amortized
each node
new element
one element
rudolf bayer
node is split
two new nodes
child pointers
maximum number
secondary storage
separator in the parent
more than the minimum number
all values
smallest element
under the minimum
root node
number of child nodes
each internal node
right sibling
two legal nodes
full nodes
balanced tree
two nodes
node may
subtree will
binary search tree
left sibling
deleting an element
largest element
every node
Search external links cited by footnotes on Wikipedia page B-tree:
|
|