
Advanced Data Structures 487
Note: From the above discussion, it is clear that the insertion, and especially deletion, is a complicated
operation in B-trees. Therefore, the size of leaf nodes is kept as large as 256 or more so that insertion and
deletion do not demand rearrangement of nodes.
10.4.4 Advantages of B-Trees
(1) As the size of a node of a B-tree is kept as large as 256 or more, the height of the tree becomes very
small. Such a node supports children in the range of (128 to 256). Therefore, insertion and deletion
operations will generally remain within the limit without causing over- or underflow of the node.
(2) As the height of a ...