Deletion of a key from a node of B-tree has to be done with lot of care because it might violate the basic
properties of the B-tree itself. For example, one must consider the following cases:
(1) After the deletion of a key in a leaf node, if the degree of the node decreases below the minimum
degree of the tree then the siblings must be combined to increase the degree to the acceptable level.
Consider the deletion of K5 8 from the B-tree given in Figure 10.34.
Since the key (8) is in the leaf of the B-tree and its deletion does not violate the degree of that leaf, the
key is deleted ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.