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. :)
Thanks for this. This video helped me whereas my professor's terrible slideshow explanations could not.
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!
Greatest video that I have finded until now. Thumbs up.
honstly this is the best explanation of B- trees in UA-cam
back then *
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.
Todo claro y listo para el examen, Gracias
this is a new concept for me, and this video has helped solidify it for me, thank you!
Dude, this is excellent. Please make a 2-3 deletion video just like this one.
muchas gracias por la explicación, me ha quedado muy claro, me costo mucho entender hasta que llegue a este video, mil gracias
Excellent tutorial.. all doubts are gone..5 thumbs up!!
Exelent explanation, I don't speak English but I understood :)
ur an amazing teacher! thank u! this really helped...
An all around very helpful and well made video. Thank you.
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 :)
Thanks :) Better than our scripts from university
This guy is a life saver
awesome video man! you explain really good
Really appreciate for the video. Make 2-3 tree inserting be an easy task.
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.
great video, great breathing
I started breathing weird after watching this video lol. Good content though!
Increase speed to 1.5. Thank me later ;)
read this too late
I love you
ty~
Thank you
The hero we deserve :D
ı really felt different after watching Indian dudes videos.
Great visual clarification, thank you
Amazing Explanation! Love this episode!
Good job and very nice explanation. Respect !!
Extremely useful. Thanks!
Thank you very much. Really enjoyed the video.
Really helped out mate thank you .
Thank you helps a lot but I think the leaves should also contain 20,40,60,80
Thank you! Very thorough explanation.
Great explanation!!
Thanks, that cleared it all up! Btw, what software is that?
Very well explained moreover the example you took covers all the possible cases !!! :)
Great concise explaination, thanks!
Excellent! You made it look so simple!
awesome .thank u very much.i v'e some exam stuff.u helped me alot.
Excelente video me sirvió mucho para mi examen y
Thanks for your video ^^ Hope you make more tut for red-black tree and deletion in 2-3 tree
Beautiful explanation thank you!
thank you sir
me ayudo un monton gracias..
it is so clear. thanks a lot.
Great Video
Great explanation thank you!
Brilliant and incredibly helpful, thank you so much! :)
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 u sir..
it was very helpful..
Very helpful, thank you
great video!
Thanks dude. Appreciate it.
thanks alot impressice ex[planation
אחלה הסבר חברים
Thank you so much Sir..
thank you
thanks. simply put - simple!
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
is duplicate possible in tree? i mean, may we input the same data that already existed in the tree?
Great tone and explanation. Keep up the good work. Thank you.
Happy new year
excellent video
very useful, thanks!
is this asmr?
sooo great !! thanks
you have a 2-3 tree deletion simulation video ? please upload :(
thank you so much!
I've never heard of a 2-3 tree before, what's it used for?
How do you calculate the maximum and the minimum number of values that can be stored in a node?
woowww its great man :D
thanks you :) #thumpup :D
I enjoyed it.
this is not a 2-3tree, 2-3-tree can have nodes of length 1
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
is there anyone watching this in 2023......... I bet not😁
hell yeah
2024*
Is this for binary trees?
Actually the b tree can insert in each node at maximum an odd number of values....
2t-1= t it will be always odd
excellent, thanks :D.
Awesome!
Thank You!
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
does 2 3 tree has deletion?
GJ!!! Thnax
Thank you! :)
THANKS !!!
great! thank you!
thanks a lot!!
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.
:)
am I the only one who find that 2-3 tree is much complicated ??
No this is scuffed my dude
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
Thanks!
great!
very very thanks
what about b tree ??
Thanks man
thank you m8
THX YOU !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
thanks!
how can one implement this without a parent pointer
good one
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
Thank u
thx a lot~
very thanks