- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

Here we will see, how to perform the deletion of a node from B+ Tree. Suppose we have a B+ Tree like below 7minus;

**Example of B+ Tree** −

Deletion has two parts. At first we have to find the element. That strategy is like the querying. Now for deletion, we have to care about some rules. One node must have at-least m/2 elements. So if we delete, one element, and it has less than m-1 elements remaining, then it will adjust itself. If the entire node is deleted, then its children will be merged, and if their size is same as m, then split them into two parts, and again the median value will go up.

Suppose we want to delete 78. Now there are two children. [75, 77], and [78, 85], then It will delete 78 from the leaf node first, after that take 85, and make a copy of key 85, and make it as root of the subtree.

**BPlusTreeDelete(x, key)** −

Input − The root of the tree, and key to delete

We will assume, that the key is present into the list Start from root node, perform exact match for key as ‘key’ till a leaf node. Let the search path be x_{1}, x_{2}, … , x_{h}. The x_{1}is first node so root, then x_{h}is leaf node. Each node x_{i}is parent of x_{i+1}delete the object where key is ‘key’ from x_{h}. if h = 1, then return, as there is only one node which is root. i := h while x_{i}underflows, do if immediate sibling node s of x_{i}, has at least m/2 + 1 elements, then redistribute entries evenly between s and x_{i}. corresponding to redistribution, a key k in the parent node x_{i-1}, will be changed. if x_{i}is non-leaf node, then k is dragged down to x_{i}. and a key from s is pushed up to fill the place of k else k is simply replaced by a key in s return else merge x_{i}with the sibling node s. Delete the corresponding child pointer in x_{i-1}. if xi is an internal node, then drag the key in x_{i-1}. which is previously divides x_{i}and s. into the new node x_{i}and s, into the new node x_{i}. else delete that key in x_{i-1}. i := i – 1 end if done

- Related Questions & Answers
- B-tree Deletion in Data Structure
- The B-tree in Data Structure
- B-tree Query in Data Structure
- B-tree Insertion in Data Structure
- B+ tree Query in Data Structure
- The B+ tree in Data Structure
- B+ tree Insertion in Data Structure
- Deletion from a Max Heap in Data Structure
- Tree Data Structure in Javascript
- R* Tree in Data Structure
- Hilbert Tree in Data Structure
- Binary Tree ADT in Data Structure
- Unrooted binary tree in Data Structure
- k-ary tree in Data Structure
- Converting B-Reps to Trees in Data Structure

Advertisements