B Tree and B+ Tree in Data Structure | Insertion in B Tree and B+ Tree | B Tree vs B+ Tree

We are covering B Tree & B+ tree in data structures and algorithms concepts, Explaining the basics of B Tree and B+ Tree with a simple real-life example from database indexing. Hopefully it will be useful for students, beginners or anyone who wants to understand data structures and algorithms.

Topics covered

- What is database indexing
- Multi-level indexing
- Why we need m-way search trees
- How B Tree and B+ Tree solve the unbalanced tree problem
- B Tree vs B+ Tree
- Why not use arrays, hash maps, or other trees for indexing?

00:00 Introduction
00:38 Disk Representation of Database Example
04:15 Expensive Disk I/O with Database Query
05:23 Indexing
08:59 Multilevel Indexing
13:52 Tree Representation of Multilevel Indexing
15:10 M-way Search Tree
16:48 M-way Search Tree Node Structure
17:38 Unbalanced M-way Search Tree
19:03 B Tree: Balanced M-way Search Tree
19:53 Rules to Construct B Tree & B+ Tree
22:30 Construct B Tree Using Example
26:15 Representing Same Example in B+ Tree
28:38 Summary of B Tree vs B+ Tree
31:15 Why B Tree / B+ Tree in Indexing Instead of Array, Hash or Other Balanced Trees?