Scribd
Upload
71 views

B+ Tree Data Structure

this is overview presentation for b plus tree

Uploaded by

Azox Gaming
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
71 views

B+ Tree Data Structure

this is overview presentation for b plus tree

Uploaded by

Azox Gaming
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 8

B+ Tree Data Structure

A Detailed Presentation on B+ Tree


Introduction to B+ Tree
• • Extension of B Tree for efficient insertion, deletion, and search
operations.
• • In B+ Tree, data is stored only in the leaf nodes, while internal nodes
hold keys.
• • Leaf nodes are linked, forming a singly linked list for efficient
searches.
B+ Tree Structure and Properties
• • Internal nodes (index nodes) store keys to access records.
• • Leaf nodes store actual data and are linked for sequential access.
• • Used to manage large data sets stored outside the main memory.
Insert Diagram: B+ Tree Structure
Advantages of B+ Tree
• • Equal number of disk accesses for all records.
• • Height remains balanced and lower than B Tree.
• • Data can be accessed sequentially or directly.
• • Faster search due to data being stored in leaf nodes.
B Tree vs. B+ Tree
• 1. B Tree: Data in both internal and leaf nodes.
• B+ Tree: Data only in leaf nodes.
• 2. B Tree: No linked leaf nodes.
• B+ Tree: Leaf nodes linked for efficient search.
• 3. B Tree: Deletion is complex.
• B+ Tree: Deletion only from leaf nodes, less complex.
B+ Tree Insertion
• 1. Insert the new value in the leaf node.
• 2. If the leaf node is full, split and promote the middle key.
• 3. If the index node is full, split and promote the middle key to the
Insert Diagram: B+ Tree Insertion Example
next level.
B+ Tree Deletion
• 1. Delete key from the leaf node.
• 2. If leaf node underflows, merge with sibling and update parent.
• 3. If index node underflows, merge and propagate changes up.
Insert Diagram: B+ Tree Deletion Example
Conclusion
• • B+ Tree is efficient for large data sets due to balanced structure and
linked leaf nodes.
• • It supports fast search, insertion, and deletion operations.
• • Commonly used in databases and file systems.

You might also like