For god's sake how hard is it to just explain it as simple as that! Thanks a lot from Germany!
@ohdude66435 жыл бұрын
Because some professors need to justify a given number of hours.
@p3chv0gel224 жыл бұрын
Ich fühle deinen Schmerz, Bruder :D
@jhindeag3 жыл бұрын
ich hab bald auch eine Klausur haha
@PatxSun9 ай бұрын
6 Jahre später, Danke wieder von Deutschland🥲😂
@Freeman9379 ай бұрын
@@PatxSun viel Erfolg 😂💪🏼
@teodorstoev26107 жыл бұрын
Finally a really good explanation! Thank you! Your video needs more views!
@MrMonsterrally6 жыл бұрын
When you go to youtube to teach you what your college professor was supposed to
@mati1979b5 жыл бұрын
there is simply too much material to cover....
@wahabfiles62605 жыл бұрын
Stop bitching!
@natanielkauppi25664 жыл бұрын
my professor doesn't give any visual examples. I crave for those.
@ybbetter99484 жыл бұрын
yeah and your college professor only covers topics related to his work...
@philippebaillargeon52043 жыл бұрын
Everytime.
@konamihatchibori7 жыл бұрын
Excellent explanation, no complicated jargon, elegant presentation. Thank you so much.
@NikkieBiteMe7 жыл бұрын
Everything about B-Trees is crystal clear now. Thank you for this amazing video!!!
@ogropor7 жыл бұрын
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
@hopefulhyena34002 жыл бұрын
This is genuinely one of the best and most helpful coding explanation videos I've ever seen.
@williamwright25837 жыл бұрын
This was a memorable presentation, simple and elegant. Can I have you as a professor?
@90sokrates6 жыл бұрын
Yeah I bet you can for like 300k+ a year :D :D
@marvinkamande935 жыл бұрын
This video has saved a life today. Bless him.
@zeroDawn-21 Жыл бұрын
This is by far the best explanation for B-Trees out there, thank you
@gobbledee556 жыл бұрын
Excellent explanation! Not too simple, not too complicated. Best B-Tree explanation I've seen so far.
@Fox66du766 жыл бұрын
Very clear, appreciated the consistency of the presentation and the little animation to visualize how B-trees work !
@chrispitterle88314 жыл бұрын
I keep coming back to this video to help me tutor my students. Thank you!
@rachitahuja60846 жыл бұрын
Thank you so much man , very simple , smooth , useful and helpful. Please keep uploading more presentations/videos !
@esmailiyou7 жыл бұрын
Yeah, searched a long time on KZbin to find this video. Thanks a lot! :)
@JoffreyB6 жыл бұрын
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
@yifengchen98802 жыл бұрын
The animation of inserting value is fantastic.
@paulhendrix85995 жыл бұрын
Great introduction with a great explanation of why they're useful!
@jonnysanty50285 жыл бұрын
I'm glad I stumbled across this video before I got sucked into other chaotic explanations.
@yevheniishudrenko38985 жыл бұрын
Beautifully structured explanation, my gratitude
@BatehamRadio5 жыл бұрын
Wow great job with the presentation! You were able to explain this while my professor was not!
@souv1k9855 жыл бұрын
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.
@102RC5 жыл бұрын
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
@night4wl9594 жыл бұрын
Excellent teaching skills, thanks!
@joaquinibanez65374 жыл бұрын
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.
@zoso253 жыл бұрын
This is very similar to Prof. Sedgwick's lectures but with an extra tidbit of their utility. Thank you!
@vaishnaviganseh28845 жыл бұрын
this video was such a saviour
@Kmac1125 жыл бұрын
man, this guy is really good.
@bokistotel6 ай бұрын
AMAZING explanation!!!!!
@vivekdalal86294 жыл бұрын
Really well explained! Thank you!
@kaos092 Жыл бұрын
I love how with m / 2 we're just expected to know they mean to round up
@АлександрБадаландабад4 жыл бұрын
Great explanation, all the best to your, Dudes )) !
@pixelpaxal5 жыл бұрын
Nice demo and clear explanation
@hao-tingliang70376 жыл бұрын
Pretty nice! This video helps me a lot. Thank you!
@heidisun70744 жыл бұрын
wow this demo is amazing! thank you!
@primeoptumas84354 жыл бұрын
Great explanation sir👏👏👏
@uzairiltifat95345 жыл бұрын
It's a great demonstration thanks for sharing it.
@benc71526 жыл бұрын
this video is freaking excellent.
@heavyraindrops47505 жыл бұрын
Do you have a video on deleting an item from a B-Tree?
@vladislavrepinsky67436 жыл бұрын
At 4:42 doesn't every node that is not a leaf have m+1 children instead of m?
@jcchurch6 жыл бұрын
Jump to 2:41 to skip past all of the intro.
@easynow65996 жыл бұрын
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..
@Careyourbusiness5 жыл бұрын
thank u Sir i wanna know the name of the application that u use for the B-trees test
@fancy_pixel5 жыл бұрын
if you wrote on google b tree visualization tool online or cs.usfca.edu b tree visualization tool
@nasosal2 жыл бұрын
Where can I meet this guy? I want to buy him a beer! He explained in 12 minutes what I couldn't grasp from 2 40-minutes long lectures! He's absolutely amazing!!!
@Heggour5 жыл бұрын
here is the link if anyone was wondering : www.cs.usfca.edu/~galles/visualization/BTree.html
@marcuskim19896 жыл бұрын
I've always thought it helpful to think that tree data structures resemble family trees, not upside-down tree organisms lol
@JP-td8gt6 жыл бұрын
Bravo! 🙌 made perfect sense to me.
@diegocolli863 жыл бұрын
Where can I find the url for the site that shows the trees?
@GBGOLC7 жыл бұрын
Simple clear and concise.
@DTV9985 жыл бұрын
Great:) 10h till the exam, 3 more trees to go:3
@ky50695 жыл бұрын
Really terse and awesome explanation, thank you
@pfiffi75093 жыл бұрын
Thank You ! From Germany Danke!!
@chris.w3913 жыл бұрын
Good explanation, thanks!
@fuahuahuatime51966 жыл бұрын
Really great explanation.
@danielk21227 жыл бұрын
Very good explanation!
@LiChuy3 жыл бұрын
The value of the data, in what part of the tree do they find?
@mohammedghu.37926 жыл бұрын
gorgeous explanation , thank you .
@motorheadbanger906 жыл бұрын
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
@j.frostybeats2 жыл бұрын
thank you sir, i loved your explenation
@ishrak16846 жыл бұрын
Thank you so much.you made my day!
@jianhuang06 жыл бұрын
I am looking for the complicated part delete from b-tree
@jmadluck6 жыл бұрын
good video, but i was looking for how to delete
@duynhanvo76733 жыл бұрын
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.
@TH3Willster6 жыл бұрын
Awesome video man
@basheeral-momani20326 жыл бұрын
thanks a lot for this awesome tutorial
@ПавелЗолотарев-ы4п3 жыл бұрын
Thanks, good explanation
@seankw28804 жыл бұрын
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?
@darrencowan45582 жыл бұрын
All nodes can only have M-1 keys, regardless if it is root/node/leaf
@LoboFrames4 жыл бұрын
Thanks, clear explanation.
@leo-rq2ei6 жыл бұрын
Great explanation!!!
@TheMeMo19995 жыл бұрын
thank you this was very helpful
@ascientist12385 жыл бұрын
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.
@jspt2562 жыл бұрын
which was this?
@ascientist12382 жыл бұрын
@@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.
@donaastor2 жыл бұрын
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
@bluewater65932 жыл бұрын
is an order 2 b-tree the same as a binary tree?
@mohammadreza.beygifard2 жыл бұрын
Thanks for the video!
@juhairahamed534211 ай бұрын
Thanks for uploading
@lidavid78093 жыл бұрын
B-Tree full details at 5:40
@ad_koishi32662 жыл бұрын
thanks so much professor!
@troooooper1004 жыл бұрын
entire education system couldn't explain this
@LLFRA4 жыл бұрын
somebody with a link to the animation site with the insert number example?
@LLFRA4 жыл бұрын
found it www.cs.usfca.edu/~galles/visualization/BTree.html
@shaunsawyer82986 жыл бұрын
That image of a self balancing tree kind of seems more appropriate for what happens when a tree is unbalanced :P
@williamwang27165 жыл бұрын
No runtime analysis?
@andrasszalai25145 жыл бұрын
What happens if there is an even (like 2,4,6) number of keys in a node. How does it split? Nice vid tho!:)
@christopherlovejoy936 жыл бұрын
That B-Tree visualization is at cs.usfca.edu/~galles/visualization/BTree.html
@stewartzayat75263 жыл бұрын
"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.
@ezekielyovel91166 жыл бұрын
Thanks a lot, this was clear and simple to understand!
@NoName664264 жыл бұрын
Here is the site they used www.cs.usfca.edu/~galles/visualization/BTree.html
@tomtao52615 жыл бұрын
Thank you very much , i got it! ~
@nealvic466 жыл бұрын
11pm watching this and thinking... where are people watching this from? looking on youtube to learn what your college professor can't teach you ... Paris here, where y'all from?
@pridegasm79755 жыл бұрын
Ukraine. Education here sucks. ^^
@XnDxNdXnD5 жыл бұрын
From South Korea. Learning by youtube is more easy to understand. Those visualizations are really explainable.
@michelef406 Жыл бұрын
@@pridegasm7975 The neighbours are not so great either.
@neux643 жыл бұрын
Who else is searching the internet about dictionary and map data structures because their instructor is using an outdated teaching pedagogy?
@tshaylatte95024 жыл бұрын
great content thank you
@paulchicos28854 жыл бұрын
Good explanation
@espicelmecanicodecombustio16325 жыл бұрын
It's just not the same without a hindi accent u_u
@pepe66665 жыл бұрын
and the nonsensical pausing on the last word in the ..sentence.
@sharun47395 жыл бұрын
@@pepe6666 thats what fullstop is for.
@pepe66665 жыл бұрын
@@sharun4739 😏
@RohanDaDev5 жыл бұрын
@@pepe6666 And that is why we.... Search.
@pepe66665 жыл бұрын
@@RohanDaDev the be t'dree.
@rawanjeraq99173 жыл бұрын
All the online students here because online college is useless
@JamesOfKS7 жыл бұрын
Nice job!
@waliky20028 ай бұрын
Ok, I have to say this. Thank you and thank you with a maximum length of trillions…..
@holger_p5 ай бұрын
Good to get an idea, but unfortunatly nobody will ever request to implement it, cause there are enough implementations out there.
@KaptainLuis6 ай бұрын
thank you so much!
@inhanhhuy5535 жыл бұрын
Great, thank you.
@halasmadi63314 жыл бұрын
when will my professor ever...
@solutions-ai3 жыл бұрын
CHONG SIANG YEW, best lecturer of all time Dm me for his email :)
@lawkhyeyueh33113 жыл бұрын
Sure I wanna learn from him. How do I contact you?