B-Tree Tutorial - An Introduction to B-Trees 

For god's sake how hard is it to just explain it as simple as that! Thanks a lot from Germany!

When you go to youtube to teach you what your college professor was supposed to

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!!!

Excellent explanation! Not too simple, not too complicated. Best B-Tree explanation I've seen so far.

This is genuinely one of the best and most helpful coding explanation videos I've ever seen.

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

Very clear, appreciated the consistency of the presentation and the little animation to visualize how B-trees work !

This video has saved a life today. Bless him.

Thank you so much man , very simple , smooth , useful and helpful. Please keep uploading more presentations/videos !

Yeah, searched a long time on RU-vid to find this video. Thanks a lot! :)

This was a memorable presentation, simple and elegant. Can I have you as a professor?

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!

Great introduction with a great explanation of why they're useful!

Beautifully structured explanation, my gratitude

Wow great job with the presentation! You were able to explain this while my professor was not!

The animation of inserting value is fantastic.

I'm glad I stumbled across this video before I got sucked into other chaotic explanations.

Pretty nice! This video helps me a lot. Thank you!

Excellent teaching skills, thanks!

This is very similar to Prof. Sedgwick's lectures but with an extra tidbit of their utility. Thank you!

Simple clear and concise.

gorgeous explanation , thank you .

Really well explained! Thank you!

It's a great demonstration thanks for sharing it.

this video was such a saviour

wow this demo is amazing! thank you!

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.

Thank you so much.you made my day!

Bravo! 🙌 made perfect sense to me.

man, this guy is really good.

Nice demo and clear explanation

this video is freaking excellent.

thank you sir, i loved your explenation

Very good explanation!

Thanks for the video!

thanks a lot for this awesome tutorial

Really great explanation.

Thanks for uploading

Good explanation, thanks!

Thanks, clear explanation.

thank you this was very helpful

Great explanation, all the best to your, Dudes )) !

I love how with m / 2 we're just expected to know they mean to round up

Really terse and awesome explanation, thank you

Great explanation sir👏👏👏

here is the link if anyone was wondering : www.cs.usfca.edu/~galles/visualization/BTree.html

thanks so much professor!

Thank You ! From Germany Danke!!

Thanks, good explanation

Great:) 10h till the exam, 3 more trees to go:3

Awesome video man

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 very much , i got it! ~

Thanks a lot, this was clear and simple to understand!

great content thank you

Nice job!

Great, thank you.

I've always thought it helpful to think that tree data structures resemble family trees, not upside-down tree organisms lol

great! Thx!

Thank you!!!!!

Do you have a video on deleting an item from a B-Tree?

Thank You

I am looking for the complicated part delete from b-tree

thank you.

Good explanation

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

Thanks a lot

Where can I find the url for the site that shows the trees?

Excellent :D

entire education system couldn't explain this

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.

thanks boss!

muito bom!!!!

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

thank u Sir i wanna know the name of the application that u use for the B-trees test

That image of a self balancing tree kind of seems more appropriate for what happens when a tree is unbalanced :P

YOU ARE LEGEND

Thanks

Ok, I have to say this. Thank you and thank you with a maximum length of trillions…..

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.

The value of the data, in what part of the tree do they find?

No runtime analysis?

"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.

Here is the site they used www.cs.usfca.edu/~galles/visualization/BTree.html

What happens if there is an even (like 2,4,6) number of keys in a node. How does it split? Nice vid tho!:)

That B-Tree visualization is at cs.usfca.edu/~galles/visualization/BTree.html

damn bro,soooooooo fkn smooth

thx man

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.

Jump to 2:41 to skip past all of the intro.

At 4:42 doesn't every node that is not a leaf have m+1 children instead of m?

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?

good video, but i was looking for how to delete

perfect

is an order 2 b-tree the same as a binary tree?

B-Tree full details at 5:40