i watched all other videos, i got nothing, i was hopeless.thanks to this man and this video FIINALLY I UNDERSTAND....the animation site is perfect to understand and demonstrate too
9:30, shouldn’t be it no more m-2 items? Because if it’s m-1 and we are inserting value, our order will be changed to m+1. Because if we insert item in node with m-1 items, it will has m items, therefore it can has m+1 children, and therefore, order will be m+1. Or I misunderstood something? Is order changeable or not? If it is so, then sorry, my mistake
it was a B-tree order of 5 (which is really a special case of a m-way tree (but balanced), where m=5, every leaf node is at the same depth and every node, except root, is at least half full, from m/2 to m-1 keys). The # of keys/children nodes of a B-tree depends on its order. The relationship between # of keys and children of a m-way tree is k = m-1
What are the awesome facts in this video? I understood every word he said about this topic and i don't undertand english completely yet hahaha. He is really incredible teaching about his field.
actually, i really loved the intro...it is just 2 minutes that in every typical lecture they skip..so if you miss something, you're completely lost to the rest of the lecture.. GREAT intro..
It seems to be a rule that a non-root leaf can only have a maximum of M-1 keys. Why is that not explicitly stated in the rules or did I miss something?
Great explanation, although viewers should be aware that the B+-tree that is more commonly tought in database systems courses is also often called B-tree.
@@jspt256 Usually, a B+-tree is understood as a B-tree variant that does not contain real keys in the inner nodes. Instead, the inner "keys" just guides the navigation in the tree. This allows to shorten the inner keys (particularly relevant for data types like strings). However, this variation is nowadays usually also called B-tree.
"I'm not going to go into the logic..." That's literally the reason I wanted to watch this video. To learn about the logic. I don't think you should have left that out.
For god's sake how hard is it to just explain it as simple as that! Thanks a lot from Germany!
Because some professors need to justify a given number of hours.
Ich fühle deinen Schmerz, Bruder :D
ich hab bald auch eine Klausur haha
6 Jahre später, Danke wieder von Deutschland🥲😂
@@PatxSun viel Erfolg 😂💪🏼
When you go to youtube to teach you what your college professor was supposed to
there is simply too much material to cover....
Stop bitching!
my professor doesn't give any visual examples. I crave for those.
yeah and your college professor only covers topics related to his work...
Everytime.
Excellent explanation, no complicated jargon, elegant presentation. Thank you so much.
Finally a really good explanation! Thank you! Your video needs more views!
Everything about B-Trees is crystal clear now.
Thank you for this amazing video!!!
This is genuinely one of the best and most helpful coding explanation videos I've ever seen.
This video has saved a life today. Bless him.
This was a memorable presentation, simple and elegant.
Can I have you as a professor?
Yeah I bet you can for like 300k+ a year :D :D
i watched all other videos, i got nothing, i was hopeless.thanks to this man and this video FIINALLY I UNDERSTAND....the animation site is perfect to understand and demonstrate too
Excellent explanation! Not too simple, not too complicated. Best B-Tree explanation I've seen so far.
This is by far the best explanation for B-Trees out there, thank you
Very clear, appreciated the consistency of the presentation and the little animation to visualize how B-trees work !
I keep coming back to this video to help me tutor my students. Thank you!
Thank you so much man , very simple , smooth , useful and helpful.
Please keep uploading more presentations/videos !
Yeah, searched a long time on UA-cam to find this video. Thanks a lot! :)
The animation of inserting value is fantastic.
Excellent teaching skills, thanks!
Beautifully structured explanation, my gratitude
I'm glad I stumbled across this video before I got sucked into other chaotic explanations.
Great introduction with a great explanation of why they're useful!
AMAZING explanation!!!!!
this video was such a saviour
Wow great job with the presentation! You were able to explain this while my professor was not!
Thank You ! From Germany
Danke!!
Really well explained! Thank you!
9:30, shouldn’t be it no more m-2 items? Because if it’s m-1 and we are inserting value, our order will be changed to m+1. Because if we insert item in node with m-1 items, it will has m items, therefore it can has m+1 children, and therefore, order will be m+1. Or I misunderstood something? Is order changeable or not? If it is so, then sorry, my mistake
at 3:25 was it a 'b tree' or a 'm-way tree'. A b tree is supposed to have a 2 keys and 3 pointers right ? Please correct me if I am wrong.
it was a B-tree order of 5 (which is really a special case of a m-way tree (but balanced), where m=5, every leaf node is at the same depth and every node, except root, is at least half full, from m/2 to m-1 keys). The # of keys/children nodes of a B-tree depends on its order. The relationship between # of keys and children of a m-way tree is k = m-1
It's a great demonstration thanks for sharing it.
I've always thought it helpful to think that tree data structures resemble family trees, not upside-down tree organisms lol
This is very similar to Prof. Sedgwick's lectures but with an extra tidbit of their utility. Thank you!
Simple clear and concise.
man, this guy is really good.
thank u Sir
i wanna know the name of the application that u use for the B-trees test
if you wrote on google b tree visualization tool online or cs.usfca.edu b tree visualization tool
Thanks for uploading
Where can I find the url for the site that shows the trees?
Nice demo and clear explanation
What are the awesome facts in this video? I understood every word he said about this topic and i don't undertand english completely yet hahaha. He is really incredible teaching about his field.
Do you have a video on deleting an item from a B-Tree?
Thanks for the video!
this video is freaking excellent.
wow this demo is amazing! thank you!
Pretty nice! This video helps me a lot. Thank you!
thank you sir, i loved your explenation
thanks so much professor!
Great explanation, all the best to your, Dudes )) !
Good explanation, thanks!
Thanks, clear explanation.
Thanks, good explanation
Great:) 10h till the exam, 3 more trees to go:3
Great explanation sir👏👏👏
Really great explanation.
gorgeous explanation , thank you .
Thank you so much.you made my day!
Bravo! 🙌 made perfect sense to me.
Very good explanation!
I love how with m / 2 we're just expected to know they mean to round up
Great explanation!!!
thanks a lot for this awesome tutorial
Really terse and awesome explanation, thank you
The value of the data, in what part of the tree do they find?
Awesome video man
here is the link if anyone was wondering : www.cs.usfca.edu/~galles/visualization/BTree.html
thank you so much!
great content thank you
is an order 2 b-tree the same as a binary tree?
thank you this was very helpful
I am looking for the complicated part delete from b-tree
At 4:42 doesn't every node that is not a leaf have m+1 children instead of m?
Thank you very much , i got it! ~
No runtime analysis?
somebody with a link to the animation site with the insert number example?
found it
www.cs.usfca.edu/~galles/visualization/BTree.html
Great, thank you.
Good explanation
That image of a self balancing tree kind of seems more appropriate for what happens when a tree is unbalanced :P
Nice job!
B-Tree full details at 5:40
Jump to 2:41 to skip past all of the intro.
actually, i really loved the intro...it is just 2 minutes that in every typical lecture they skip..so if you miss something, you're completely lost to the rest of the lecture..
GREAT intro..
great! Thx!
Thanks a lot, this was clear and simple to understand!
entire education system couldn't explain this
thank you.
Thank You
It seems to be a rule that a non-root leaf can only have a maximum of M-1 keys. Why is that not explicitly stated in the rules or did I miss something?
All nodes can only have M-1 keys, regardless if it is root/node/leaf
Thank you!!!!!
good video, but i was looking for how to delete
Who else is searching the internet about dictionary and map data structures because their instructor is using an outdated teaching pedagogy?
All the online students here because online college is useless
It's just not the same without a hindi accent u_u
and the nonsensical pausing on the last word in the ..sentence.
@@pepe6666 thats what fullstop is for.
@@sharun4739 😏
@@pepe6666 And that is why we.... Search.
@@RohanDaDev the be t'dree.
I love the demos but just two levels....i need to see it in more complex examples but since this was an intro i guess the trivial ones are necessary
wow, i try to understand from web pages but still not working. With your explanation, it help me a lot, still not at the clearest level. Thanks a lot.
Here is the site they used www.cs.usfca.edu/~galles/visualization/BTree.html
Great explanation, although viewers should be aware that the B+-tree that is more commonly tought in database systems courses is also often called B-tree.
which was this?
@@jspt256 Usually, a B+-tree is understood as a B-tree variant that does not contain real keys in the inner nodes. Instead, the inner "keys" just guides the navigation in the tree. This allows to shorten the inner keys (particularly relevant for data types like strings). However, this variation is nowadays usually also called B-tree.
YOU ARE LEGEND
Excellent :D
thanks boss!
What happens if there is an even (like 2,4,6) number of keys in a node. How does it split? Nice vid tho!:)
muito bom!!!!
Thanks a lot
"I'm not going to go into the logic..." That's literally the reason I wanted to watch this video. To learn about the logic. I don't think you should have left that out.
damn bro,soooooooo fkn smooth