B-trees in 4 minutes - Search

[@nithyashreeravi8380]

I remember an interview question from red black trees. I had watched your videos and it helped me crack my first job. From tier 3 college -> Software Engineer. Thank you 😊.

[@sorvex9]

Tier 3 college LMFAO. Americans are so funny.

[@WealthyMotivated29]

It's called great come back after 5 years.❤💚💛

[@randomtrucks]

Not sure if that's a mistake at 3:53: the returned node should be (D, 0) instead of (D, 1), no?

[@layanalthubaiti1480]

Thank you very much❤️❤️. Your videos explain to me the hardest algorithm in a very simple way.🤩

[@matteomaggioni7139]

great channel for students! thank you!! :)

[@Hi_im_R3V]

Could you make a video on Big Omega, and Big Theta time complexity for algorithms? Thanks so much! :))

[@evanhackett9632]

Nice video!

[@youtubestar1525]

Thanks for explaining it.

[@harshdalal216]

Thanks for all the videos, they are really helping me with my uni. Also, will u be making a video on Shell Sorting?

[@MichaelSambol]

I'll add it to the list!

[@DCentFN]

HE RETURNS

[@thechessplayer8328]

Why not use bsearch within a node?

[@logicmatthewlearning]

Good question