Scribd
Upload
14 views

B-Tree, B+Tree

The document discusses insertion and deletion of elements in B-trees and B+ trees. It explains that B-trees allow for searching, sequential access, insertions and deletions in sorted order. Elements are inserted by adding keys in ascending order to nodes with between n/2 and n child pointers. Deletion removes keys while maintaining the balanced tree structure.

Uploaded by

964swati.thakur
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views

B-Tree, B+Tree

The document discusses insertion and deletion of elements in B-trees and B+ trees. It explains that B-trees allow for searching, sequential access, insertions and deletions in sorted order. Elements are inserted by adding keys in ascending order to nodes with between n/2 and n child pointers. Deletion removes keys while maintaining the balanced tree structure.

Uploaded by

964swati.thakur
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

INSERTION OF ELEMENTS IN B -TREE B- TREE

• B-tree is a data structure that provides so ed data allows searches,


sequential access, a achments and removals in so ed order.
• The B-tree simplifies the binary search tree by allowing nodes with more
than two children.

INDEXING USING B-TREE


• B-tree stores data such that each node contains keys in ascending order.
• Each of these keys has two references to another two child nodes.
• The le side child node keys are less than the current keys, and the right
side child node keys are more than the current keys.
• If a single node has “n” number of keys, then it can have maximum “n+1”
DELETION OF ELEMENTS IN B -TREE child nodes.
B+ Trees are self-balancing, which means B+ Trees are multi-level data
that as data is added or removed from structures, with a root node at the
the tree, it automatically adjusts itself to top and one or more levels of

INDEXING
maintain a balanced structure. internal nodes below it.

B+ TREE
B+ Trees maintain the order of the keys B+ Trees contain two types of nodes:
IN
B+TREE
in the tree, which makes it easy to Internal Nodes:
pe orm range queries and other Internal Nodes are the nodes that are present in at
operations that require so ed data. least n/2 record pointers, but not in the root node,
Leaf Nodes:
Leaf Nodes are the nodes that have n pointers.

INSERTION OF ELEMENTS IN B+TREE DELETION OF ELEMENTS IN B+TREE

You might also like