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.
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.