2-3 Tree Insertion

[@maryrooster8737]

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

[@shadowturtle1425]

It was very easy to understand, and you gave a lot of examples of how each case will turn out. Thank you very much!

[@masterparks1]

Thanks for this. This video helped me whereas my professor's terrible slideshow explanations could not.

[@joseluiscochinesalazar399]

Greatest video that I have finded until now. Thumbs up.

[@SN-ow1bp]

this is a new concept for me, and this video has helped solidify it for me, thank you!

[@ArwaBasha]

honstly this is the best explanation of B- trees in KZbin

[@Y.Albasel]

back then *

[@Anakryu]

muchas gracias por la explicación, me ha quedado muy claro, me costo mucho entender hasta que llegue a este video, mil gracias

[@gerhard883]

Todo claro y listo para el examen, Gracias

[@tfluan0606]

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.

[@RodrigoCFD]

Dude, this is excellent. Please make a 2-3 deletion video just like this one.

[@minc33]

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.

[@loweywimusic]

awesome video man! you explain really good

[@RAVIKISHOREVADDIPARTHY]

Excellent tutorial.. all doubts are gone..5 thumbs up!!

[@kainat21]

ur an amazing teacher! thank u! this really helped...

[@c78867886]

Really appreciate for the video. Make 2-3 tree inserting be an easy task.

[@juanmanuelperezcastro1497]

Exelent explanation, I don't speak English but I understood :)

[@Laz3rs]

An all around very helpful and well made video. Thank you.

[@ninjastreet5]

This guy is a life saver

[@MorkP]

Thanks :) Better than our scripts from university

[@DoubblKeks]

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 :)

[@Untergrundhase]

great video, great breathing

[@ibrahimunal1206]

ı really felt different after watching Indian dudes videos.

[@jirizelenka9460]

Great visual clarification, thank you

[@sammao9166]

Thank you helps a lot but I think the leaves should also contain 20,40,60,80

[@kikchan94]

Good job and very nice explanation. Respect !!

[@牛岱]

Amazing Explanation! Love this episode!

[@matthewkim5420]

I started breathing weird after watching this video lol. Good content though!

[@vinraghav8664]

Thank you very much. Really enjoyed the video.

[@gunnar560]

Thank you! Very thorough explanation.

[@shehroozkhandaker2553]

Extremely useful. Thanks!

[@tikareilu]

Thanks, that cleared it all up! Btw, what software is that?

[@notJustCoding]

Really helped out mate thank you .

[@TrangPham-kc7ft]

Thanks for your video ^^ Hope you make more tut for red-black tree and deletion in 2-3 tree

[@ananthrulz]

Excellent! You made it look so simple!

[@rohitsingh-ym9ns]

Very well explained moreover the example you took covers all the possible cases !!! :)

[@binexec]

Great concise explaination, thanks!

[@ruwaa5407]

Great explanation!!

[@gruppenzwangimweb20]

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?

[@isidme]

Increase speed to 1.5. Thank me later ;)

[@martinligabue]

read this too late

[@wesssel9318]

I love you

[@l_sx8722]

ty~

[@moj8301]

Thank you

[@KALIMAindia]

The hero we deserve :D

[@abhiram3754]

awesome .thank u very much.i v'e some exam stuff.u helped me alot.

[@byanjati7228]

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

[@LudwigvanBeethoven2]

Great tone and explanation. Keep up the good work. Thank you. Happy new year

[@GagePeterson]

Beautiful explanation thank you!

[@mehmetkarayel9390]

it is so clear. thanks a lot.

[@שמוליקבכר]

thanks alot impressice ex[planation אחלה הסבר חברים

[@Linkman90]

Brilliant and incredibly helpful, thank you so much! :)

[@rpdhalwani]

thank u sir.. it was very helpful..

[@bryanalonzo2572]

Excelente video me sirvió mucho para mi examen y

[@firativerson]

Great explanation thank you!

[@jrforesh]

Thanks dude. Appreciate it.

[@jijio7120]

Very helpful, thank you

[@bober275]

great video!

[@gyammyvault]

Actually the b tree can insert in each node at maximum an odd number of values.... 2t-1= t it will be always odd

[@Jonathan-jt5ih]

Thank you so much Sir..

[@ethanhsu5553]

Great Video

[@jos3008]

is duplicate possible in tree? i mean, may we input the same data that already existed in the tree?

[@ArKaNeSSS]

me ayudo un monton gracias..

[@sumithpuri]

thanks. simply put - simple!

[@calvin0630]

is this asmr?

[@rajgopalmutnali1127]

thank you sir

[@becker990]

excellent video

[@villadav]

very useful, thanks!

[@CeltiC15]

How do you calculate the maximum and the minimum number of values that can be stored in a node?

[@SM-hp1yb]

sooo great !! thanks

[@mrM4rcu5]

this is not a 2-3tree, 2-3-tree can have nodes of length 1

[@chieesntra]

thank you so much!

[@nitsuj1001]

I heard, that only the leafs contain data. But here the data are in the nodes, right?

[@nitsuj1001]

Im wondering the same thing, i wondered 4 years ago,. Seems like i didnt learn much in this time lol

[@ridel929]

you have a 2-3 tree deletion simulation video ? please upload :(

[@a4finger]

I've never heard of a 2-3 tree before, what's it used for?

[@nhatnguyenhong6411]

excellent, thanks :D.

[@mohance]

I enjoyed it.

[@ml20324]

thank you

[@aryanshaw4732]

is there anyone watching this in 2023......... I bet not😁

[@shawty7819]

hell yeah

[@wisdom.218]

2024*

[@ridel929]

woowww its great man :D thanks you :) #thumpup :D

[@NikhilHablani]

Thank you! :)

[@nothingmuchyou]

At 3:54 why not put 30 in the same node as 50? Why make a new node with 30?

[@marialauraaquino6574]

because 30

[@hhcdghjjgsdrt235]

the definition said its either 1 value with 2 children or 2 value with 3 children

[@WINIFREDWU1103ok]

Awesome!

[@asadmasood7771]

need answer ASAP, u inserted 50 then 60 then if we have to insert 55 what do we have to do?

[@asadmasood7771]

+Hamza Akthar thanks a lot

[@mvgamers0835]

+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. :)

[@Unison_007]

THX YOU !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

[@9Manhuco9]

GJ!!! Thnax

[@Zookhaarh]

THANKS !!!

[@yalda1661]

great! thank you!

[@nandkishorenangre8244]

its kind of a b tree ? with no. of values in a node fixed to 2 m i right

[@emailgames1508]

it is an (a b) tree with a=2 and b=3

[@tedchao456]

thanks a lot!!

[@NeymarJr-uj1wf]

am I the only one who find that 2-3 tree is much complicated ??

[@boggeshzahim3713]

No this is scuffed my dude

[@pathway27]

Thank You!

[@bbs-3358]

does 2 3 tree has deletion?

[@ssjg3156]

Thanks man

[@sarahal-ghanmi61]

very very thanks what about b tree ??

[@mortl8324]

Is this for binary trees?

[@Ztenam976]

thank you m8

[@chucksneedmoreland]

how can one implement this without a parent pointer

[@awakening882]

great!

[@interpro]

Thanks!

[@oliverszk]

look at 7:55, you have so many blank spaces down in your tree

[@gouthamnagraj5445]

good one

[@mjcalles16]

I don't understand why you never put 3 values in a node, you can do that according to the definition

[@KattungeMedMotorsag]

No, you're probably thinking of a 2-3-4 tree.

[@AkmalMuhamad]

^ was right, it is 2-3-4 tree, simply different thing

[@bordonwork]

I think you're talking about a B-Tree.

[@sherifportrait]

Oh greaaaaaaaaaaaaaat

[@XieQiu]

thanks!