B-trees in 6 minutes - Insertions 

tbh we need you to make more short tutorials like this for basic algorithms so that we don't have to read forums and watch 20 minutes long tutorials for simple algorithms. Also, you are really good at summarizing things :)

Watched your video series on B-trees and i already learned way more than my professor’s lecture that totaled 4 hours

Awesome! I don't have the focus to watch few hours of info just for something basic like this, in 7 minutes I understood more than in 1 hour of unscripted videos

Thank you so much for your work. 🙏🏻 You are making it so much easier to understand topics like these. I hope that you’ll continue to make videos like this one. Greetings from Germany.

your videos are very concise and extremely valuable to a college student like myself, thank u

very nice video, thank you for explanation ^^ as a tired uni student, i appreciate your slow tempo of voice :)

this is great, keep it going!

Awesome mate!!

Hello. I've found a bug in your code. At 2:55, you add only 2 children to y, and 3 children to z. Because of that, 1 child will be missing, as we can max have 2*t children (in this case 6). I tested it using your code, adding 26 in delete example after all the deletions. After adding a node, the number of nodes will be less than before adding, simply because we just miss 1 child in the process. If we do (y.children = y.children[0: t]) instead of (y.children = y.children[0: t - 1]), code will be working correctly. Although, thank you for your work. If not for you, I wouldn't be able to inderstant this topic this well. You help a lot. Keep it up!

thank you so much !!!

underrated channel subbed!

can you please make a video on partitioning tree to make it balanced

Can you teach b+ tress too?

thank you brother

good video

good

Is this same as B+ Tree?

2:48 wont y.keys = y.keys[0: t-1] include the median? at which step is the median removed from the y node?

I am able to understand nothing

Too much reverb bro.

What is the result of this (The result in the class is totally different from what I got following this video) 🥲 insert(13) /when t=2 [16 | X | X ] / \ [ 1 | 4 | 9 ] [ 16 | 20 | 25 ]