B-tree: Difference between revisions

Revision as of 10:22, 21 August 2005

Revision as of 18:14, 22 August 2005

Line 26:

# First, search for the position into which the node should be inserted. Then, insert the value into that node.

# If no node is in an illegal state then the process is finished.

# If some node has too many elements, split it is split into two nodes,. each with the minimum amount of elements.Continue Thisthis process continues recursively up the tree. until theIf rootyou is reached. Ifsplit the root isnode, split,create a new root is creatednode. Typically You must select the minimum and maximum number of elements must be selected such that the minimum is no more than one half the maximum in order for this to work.

=== Deletion ===