10.2  B Trees and B+ Trees. How they are useful in Databases @abdul_bari
10.2  B Trees and B+ Trees. How they are useful in Databases  @abdul_bari
Uploaded March 2018 | Updated September 2026, 2 weeks ago
This video explains
B Trees and B+ Trees and how they are used in databases.

Insertion, Deletion and Analysis will be covered in next video.

Each node of a B+ Tree is a block on Disk. The degree of a Tree is decided based number of keys and child pointers that can fit inside a block.

PATREON : patreon.com/bePatron?u=20475192

Courses on Udemy
================
Java Programming
udemy.com/course/java-se-programming/?referralCode=C71BADEAA4E7332D62B6

Data Structures using C and C++
udemy.com/course/datastructurescncpp/?referralCode=BD2EF8E61A98AB5E011D

C++ Programming
udemy.com/course/cpp-deep-dive/?referralCode=E4246A516919D7E84225
10.2  B Trees and B+ Trees. How they are useful in Databases2.7.3 MergeSort in-depth AnalysisWhy Object Orientation - Hindi3.4 Huffman Coding - Greedy MethodMiddleware Technologies Explained in Hindi6.4 Hamiltonian Cycle - BacktrackingAsymptotic Notations - SimplifiedHow Java is Platform Independent8. NP-Hard and NP-Complete Problems4.3.1 Matrix Chain Multiplication (Program) - Dynamic ProgrammingAbdul Bari Live Stream6. Everything about Variables in JAVA
Abdul Bari |

10.2 B Trees and B+ Trees. How they are useful in Databases

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER