B-Tree | Set 3 (Delete) It is recommended to refer following posts as prerequisite of this post. B-Tree is a type of a multi-way search tree. So, if you are not familiar with multi-way search trees in general, it is better to take a look at this video lecture from IIT-Delhi , before proceeding further. Once you get the basics of a multi-way search tree clear, B-Tree operations will be easier to understand. Deletion process: Deletion from a B-tree is more complicated than insertion, because we can delete a key from any node-not just a leaf—and when we delete a key from an internal node,
Read full article from B-Tree | Set 3 (Delete) | GeeksforGeeks
No comments:
Post a Comment