Lec-103: Difference b/w B-Tree & B+Tree in Hindi with examples

preview_player
Показать описание

►Database Management System(Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
►Design and Analysis of algorithms (DAA):
►Computer Architecture (Complete Playlist):
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Operating System:
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Data Structure:
►Graph Theory:
►Programming in C:
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:

#BTreevsB+Tree#MultilevelIndexing#DBMS#GATE#UGCNET#NIELIT#CollegeUniversityExam
Рекомендации по теме
Комментарии
Автор

Love all your videos. Short, informative, easy to understand, all areas covered.

adil_k
Автор

Best video to learn B trees, totally grasped for first time, thanks a lot

sahilsharma
Автор

Looking handsome in this shirt and hairstyle..🙂😊

exploringheart
Автор

How many of think that there are two trees b minus tree and b plus tree😂

yoursgnan
Автор

Thank you Sir. your way of teaching is awesome. 🙂

sumbalkhan
Автор

Very clear explanation
Thank you so much for u r clarification

AjayPulapa
Автор

Sir u are the best teacher on you tube and reallife.. really 🥰🤩

chanchalsharma
Автор

Sir ur videos ar awesome 😁😁 helped alot in ma exams Nd ur handsome 😘

minalpatil
Автор

Q. 1 What if the data set given is not sufficient to create all the leaf node (then it will not be a balanced tree)
Q. 2 what if I want to add another node (data) then there is no block pointer (in B+ tree) to create a leaf node, then how to create it.?

Odcoc
Автор

How much peoples is watches one days before exams !

Babuubhaiii
Автор

sadela padhafa hai
kuch ata nhi
bas paise ke liye video banata hai

sayednaeem
Автор

Summary...
B tree
structure is - p*block pointer + (p-1)data pointer + (p-1)keys <= block size
p is order

b+ tree
internal
p*blockpointer + (p-1)keys <=block size
leaf
1*block pointer + p*keys + p*datapoointer <= block size

b tree more block access due to more depth of tree
b+ tree less block access to fetech data due to less depth of tree..

vipingautam
Автор

You are a magician. Whenever we find that any subject has been already covered by you, we get confidence that we can ace that subject. Thank you soo much sir. You're a life saver.

aryanjoshi
Автор

Khud achha content detaa hai aur saath me thank you bhi boltaa hai
Kamaal ka bandaa hai❤️❤️❤️❤️😘😘

gujjucarry
Автор

Sir i am preparing for gate through your lectures sir it’s is very helpful for basics.so I request you sir to pls upload question based on TLB numerical with page fault occurs in OPERATING SYSTEM ..????

kiranmathankar
Автор

For a while i thought...
There's is B - (minus)
And B + (plus) tree 😅

rahulsardesai
Автор

Very easy explanations of difficult topics ..l always get bored while studing these topics of computer science...but sir your energy and efforts made me to focus ...great job sir ....really appreciates your hardwork

KanikaKumariMA
Автор

Hello Sir
I just wanted to thank you for clearing my concept about DBMS, As i am myself assistant professor CSE dept, as it helped a lot in improving my teaching, You are doing great job. 👍👍

Miss
Автор

I am watching before 1 hour our sem exam 😂

Aryan-mwmh
Автор

Thank you very much sir, finally I found a great teacher in the world 🌎

nouravchoudhary