Your videos are really wonderful and have helped me and other students more than you can imagine. Please create more videos! I'd love to see a clear and direct explanation of time complexity (especially for exponential running times), recurrence equations/master's theorem, the basic sorts (mergesort, quicksort), max-heaps/min-heaps, hash tables (chaining, linear probing, double hashing), B-trees, topological sort, Floyd-Warshall algorithm, Union-Find, and most importantly DYNAMIC PROGRAMMING (the bane of every beginner computer science student).
this is so awesome, thx! - i will write a test about database systems which includes the 2-3 trees as well. I totally understood it wrong from my script, but now i know how to deal with it. thx a lot :)
+Asad Masood The middle insertion is always going to be pushed up if a node has more than two values. Each node can only hold two values so when it exceeds that you'll have to change it by pushing up the tree creating another level of height if necessary. :)
Your videos are really wonderful and have helped me and other students more than you can imagine. Please create more videos! I'd love to see a clear and direct explanation of time complexity (especially for exponential running times), recurrence equations/master's theorem, the basic sorts (mergesort, quicksort), max-heaps/min-heaps, hash tables (chaining, linear probing, double hashing), B-trees, topological sort, Floyd-Warshall algorithm, Union-Find, and most importantly DYNAMIC PROGRAMMING (the bane of every beginner computer science student).
It was very easy to understand, and you gave a lot of examples of how each case will turn out. Thank you very much!
Thanks for this. This video helped me whereas my professor's terrible slideshow explanations could not.
Greatest video that I have finded until now. Thumbs up.
this is a new concept for me, and this video has helped solidify it for me, thank you!
honstly this is the best explanation of B- trees in UA-cam
back then *
16 years, yet still fire🔥🔥
muchas gracias por la explicación, me ha quedado muy claro, me costo mucho entender hasta que llegue a este video, mil gracias
Todo claro y listo para el examen, Gracias
Exelent explanation, I don't speak English but I understood :)
This guy's tutorial reminds me of how people talk after they walk up a flight of stairs and play it off like they're not gassed.
To someone enter in this video and watch this comment, after 14 years, this video is steal the clearest 2-3 tree example from nothing to a whole tree.
ur an amazing teacher! thank u! this really helped...
Dude, this is excellent. Please make a 2-3 deletion video just like this one.
this is so awesome, thx! - i will write a test about database systems which includes the 2-3 trees as well. I totally understood it wrong from my script, but now i know how to deal with it. thx a lot :)
Excellent tutorial.. all doubts are gone..5 thumbs up!!
An all around very helpful and well made video. Thank you.
Really appreciate for the video. Make 2-3 tree inserting be an easy task.
awesome video man! you explain really good
This guy is a life saver
Thanks :) Better than our scripts from university
Good job and very nice explanation. Respect !!
Amazing Explanation! Love this episode!
At 3:54 why not put 30 in the same node as 50? Why make a new node with 30?
because 30
the definition said its either 1 value with 2 children or 2 value with 3 children
thanks dude!! i didn`t get this till i saw the video. isn`t it the b-tree algorithm that is used for relational databases?
Thank you helps a lot but I think the leaves should also contain 20,40,60,80
Great visual clarification, thank you
Thanks, that cleared it all up! Btw, what software is that?
I started breathing weird after watching this video lol. Good content though!
ı really felt different after watching Indian dudes videos.
Great concise explaination, thanks!
Very well explained moreover the example you took covers all the possible cases !!! :)
Thank you very much. Really enjoyed the video.
Extremely useful. Thanks!
great video, great breathing
Great tone and explanation. Keep up the good work. Thank you.
Happy new year
something doesn't clear i saw from this video, but if u add the separator on the node, maybe it will bring a great different feels
Thanks for your video ^^ Hope you make more tut for red-black tree and deletion in 2-3 tree
awesome .thank u very much.i v'e some exam stuff.u helped me alot.
Thank you! Very thorough explanation.
Excellent! You made it look so simple!
is duplicate possible in tree? i mean, may we input the same data that already existed in the tree?
Really helped out mate thank you .
How do you calculate the maximum and the minimum number of values that can be stored in a node?
Increase speed to 1.5. Thank me later ;)
read this too late
I love you
ty~
Thank you
The hero we deserve :D
Excelente video me sirvió mucho para mi examen y
Great explanation!!
Beautiful explanation thank you!
I've never heard of a 2-3 tree before, what's it used for?
you have a 2-3 tree deletion simulation video ? please upload :(
Actually the b tree can insert in each node at maximum an odd number of values....
2t-1= t it will be always odd
I heard, that only the leafs contain data. But here the data are in the nodes, right?
Im wondering the same thing, i wondered 4 years ago,. Seems like i didnt learn much in this time lol
this is not a 2-3tree, 2-3-tree can have nodes of length 1
Brilliant and incredibly helpful, thank you so much! :)
need answer ASAP,
u inserted 50 then 60 then if we have to insert 55 what do we have to do?
+Hamza Akthar thanks a lot
+Asad Masood The middle insertion is always going to be pushed up if a node has more than two values.
Each node can only hold two values so when it exceeds that you'll have to change it by pushing up the tree creating another level of height if necessary.
:)
thank you sir
thank u sir..
it was very helpful..
it is so clear. thanks a lot.
Thank you so much Sir..
Is this for binary trees?
thanks alot impressice ex[planation
אחלה הסבר חברים
does 2 3 tree has deletion?
Very helpful, thank you
Who’s watching in 2024
IT IS 2025 NOT 2024
Great explanation thank you!
its kind of a b tree ?
with no. of values in a node fixed to 2
m i right
it is an (a b) tree with a=2 and b=3
me ayudo un monton gracias..
look at 7:55, you have so many blank spaces down in your tree
how can one implement this without a parent pointer
Thanks dude. Appreciate it.
is this asmr?
Great Video
thanks. simply put - simple!
great video!
excellent video
thank you
is there anyone watching this in 2023......... I bet not😁
hell yeah
2024*
very very thanks
what about b tree ??
I don't understand why you never put 3 values in a node, you can do that according to the definition
No, you're probably thinking of a 2-3-4 tree.
^ was right, it is 2-3-4 tree, simply different thing
am I the only one who find that 2-3 tree is much complicated ??
No this is scuffed my dude
thank you so much!
sooo great !! thanks
very useful, thanks!
excellent, thanks :D.
I enjoyed it.
THX YOU !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
Awesome!
woowww its great man :D
thanks you :) #thumpup :D
Thank you! :)
Your breathing is making me uneasy. Consider trying to cut it out because it sounds like you just ran a mile. Good video though.
can a leaf contain more than a data inside of it?
it can contain whatever you want it to contain baby
Thank You!
good one
this is not a 2-3 tree, data in 2-3 trees is only stored in the leaves.
THANKS !!!
great! thank you!
thanks a lot!!
thank you m8
Спасибо помог на алгосах
Thanks!