2. Introduction
• B-Tree is a self-balancing search tree.
• B-Tree was developed in the year of 1972 by Bayer and
McCreight with the name Height Balanced m-way Search Tree.
• Later it was Named as B-Tree.
• They were designed to work well on Direct Access secondary storage
devices (magnetic disks).
• B-trees (and variants like B+ and B* trees ) are widely used in
database systems.
3. Need
• Unlike self-balancing binary search trees, it is optimized for systems
that read and write large blocks of data.
• It is most commonly used in database and file systems.
• Which is use to store huge size of data.
4. Algorithm
• Insertion Algorithm
• B-tree requires first traversal in B-tree.
• Through traversal it will find that key to be inserted is
already existing or not.
• If key does not exist in trees then through traversal it
will reach leaf node.
We have two cases for inserting:-
1.Node is not full.
2.Node is already full.
5. Insertion Algorithm
Example:-Let us take a list of key and create a B-tree.
10,20,50,60,40,80,100
Solution:
1.Insert 10
2.Insert 20
3.Insert 50
4.Insert 60
10
10 20 50
10 20 50 60
10 20
7. Algorithm
• Deletion Algorithm
• Deletion of key also requires first traversal in B-tree.
• After reaching on particular node, two cases may occur:
1.Node is leaf
node.
2.Node is non-
leaf node.
9. Application
• Huge collection of records into a file structure.
• Any record in it can be searched very efficiently
• Insertion, deletion and modification operations can be carried out
perfectly and efficiently.
10. Reference
• Data structure using c (Udit Agrawal)
• https://www.researchgate.net/publication/210381551_Analysis_of_B
-tree_data_structure_and_its_usage_in_computer_forensics.
• https://pdfs.semanticscholar.org/presentation/2fd4/2646536d516d4
cb31cf2ade30f95cb3b6d5e.pdf.