B-Tree Tutorial - An Introduction to B-Trees
HTML-код
- Опубликовано: 22 июл 2024
- Learn more advanced front-end and full-stack development at: www.fullstackacademy.com
In this tutorial, Joshua Maas-Howard introduces the topic of B-Trees. You'll learn how B-Trees are structured, what their benefits are, and when you should think about using them. - Наука
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 😂💪🏼
Excellent explanation, no complicated jargon, elegant presentation. Thank you so much.
Everything about B-Trees is crystal clear now.
Thank you for this amazing video!!!
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.
Finally a really good explanation! Thank you! Your video needs more views!
Excellent explanation! Not too simple, not too complicated. Best B-Tree explanation I've seen so far.
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
This is genuinely one of the best and most helpful coding explanation videos I've ever seen.
Very clear, appreciated the consistency of the presentation and the little animation to visualize how B-trees work !
Thank you so much man , very simple , smooth , useful and helpful.
Please keep uploading more presentations/videos !
This video has saved a life today. Bless him.
Yeah, searched a long time on RUclips to find this video. Thanks a lot! :)
Great introduction with a great explanation of why they're useful!
This is by far the best explanation for B-Trees out there, thank you
I keep coming back to this video to help me tutor my students. Thank you!
Thanks for this amazing video! Helped clear up what B-trees do!
Beautifully structured explanation, my gratitude
Wow great job with the presentation! You were able to explain this while my professor was not!
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
The animation of inserting value is fantastic.
Pretty nice! This video helps me a lot. Thank you!
Simple clear and concise.
This is very similar to Prof. Sedgwick's lectures but with an extra tidbit of their utility. Thank you!
Excellent teaching skills, thanks!
Really well explained! Thank you!
gorgeous explanation , thank you .
It's a great demonstration thanks for sharing it.
Bravo! 🙌 made perfect sense to me.
this video was such a saviour
wow this demo is amazing! thank you!
I'm glad I stumbled across this video before I got sucked into other chaotic explanations.
Thank you so much.you made my day!
AMAZING explanation!!!!!
this video is freaking excellent.
Very good explanation!
I am looking for the complicated part delete from b-tree
Really great explanation.
thanks a lot for this awesome tutorial
thank you this was very helpful
Nice demo and clear explanation
man, this guy is really good.
Thanks for the video!
Do you have a video on deleting an item from a B-Tree?
Really terse and awesome explanation, thank you
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
Good explanation, thanks!
Thanks for uploading
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.
Where can I find the url for the site that shows the trees?
Thanks, clear explanation.
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
thank you sir, i loved your explenation
I love how with m / 2 we're just expected to know they mean to round up
thanks so much professor!
Awesome video man
Great explanation, all the best to your, Dudes )) !
Nice job!
Thank you very much , i got it! ~
Thank You ! From Germany
Danke!!
Thanks, good explanation
Great explanation sir👏👏👏
Great, thank you.
thank you so much!
Thanks a lot, this was clear and simple to understand!
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
great content thank you
Great:) 10h till the exam, 3 more trees to go:3
No runtime analysis?
great! Thx!
At 4:42 doesn't every node that is not a leaf have m+1 children instead of m?
Thank you!!!!!
somebody with a link to the animation site with the insert number example?
found it
www.cs.usfca.edu/~galles/visualization/BTree.html
The value of the data, in what part of the tree do they find?
Thanks a lot
Good explanation
Excellent :D
Thank You
thank you.
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
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!:)
is an order 2 b-tree the same as a binary tree?
Thanks
I've always thought it helpful to think that tree data structures resemble family trees, not upside-down tree organisms lol
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.
good video, but i was looking for how to delete
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
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
That image of a self balancing tree kind of seems more appropriate for what happens when a tree is unbalanced :P
muito bom!!!!
thx man
here is the link if anyone was wondering : www.cs.usfca.edu/~galles/visualization/BTree.html
damn bro,soooooooo fkn smooth
perfect
Ok, I have to say this. Thank you and thank you with a maximum length of trillions…..
Godlike video
That B-Tree visualization is at cs.usfca.edu/~galles/visualization/BTree.html
I was inplementing deletion ... LAST 2 DAYS. It is NOT _equally_ complicated. I had 38 cases to happily cover. I had to use bitmasks and bitwise operations to avoid crazy branching
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..