- 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
The B+ tree in Data Structure
Here we will see what are the B+ Trees. The B+ Trees are extended version of B-Trees. This tree supports better insertion, deletion and searching over B-Tree.
B-trees, the keys and the record values are stored in the internal as well as leaf nodes. In B+ tree records, can be stored at the leaf node, internal nodes will store the key values only. The leaf nodes of the B+ trees are also linked like linked list
Example of B+ Tree −
This supports basic operations like searching, insertion, deletion. In each node, the item will be sorted. The element at position i has child before and after it. So children sored before will hold smaller values, and children present at right will hold bigger values.
Advantages over B-Tree
Records can be fetched in equal number of disk accesses
Height of the tree remains balanced, and less as compared to B-Trees
As the leafs are connected like linked list, we can search elements in sequential manner also
Keys are used for indexing
The searching is faster, as data are stored at leaf level only.
- Related Questions & Answers
- The B-tree 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
- B-tree Deletion in Data Structure
- B-tree Query in Data Structure
- B-tree Insertion in Data Structure
- B+ tree Query in Data Structure
- B+ tree Deletion in Data Structure
- B+ tree Insertion in Data Structure
- Insertion in the Red Black Tree in Data Structure
- Splay in Virtual Tree in Data Structure