Your videos are absolutely THE best about different BSTs, super easy to understand, thank you!
@elgaeagle2 жыл бұрын
This is a pretty interesting data structure and it highlights pretty well the kind of trade offs that need to be made depending on what you want to do. Looking forward to the next videos on the topic. Thanks for the great content! Its helped me out a lot and I presume many others. All the best!
@MichaelSambol2 жыл бұрын
I appreciate the support! Thank you for watching.
@CamaradaArdi Жыл бұрын
B trees don't need to be for disk only. The Rust standard library provides it for in memory trees because of cache locality. They're often times much faster than red black trees.
@noelgallagher3646 Жыл бұрын
This!! Sequential access is better for cache locality instead of random access
@ravindrapunekar84332 жыл бұрын
Thank you for all videos. this playlist is very helpful
@siddheshs4068 Жыл бұрын
You are a lifesaver Thank you so much
@arhum122426 күн бұрын
Hi Michael, I was wondering If you could make a video on Splay trees as well (or if you have already? I wasn't able to find it in searches)
@simpleman-fd3rb6 ай бұрын
Thank you so mụch! Your video is very helpful and easy to understand 🥰
@MayankLongiany Жыл бұрын
Thank you, Mr Michael. Cheers from a fellow educator/teacher! BTW, 400 USD for an extra 32 GB? Apple is Apple, after all haha.
@Nega_Samurai Жыл бұрын
Thank you! That was so clear!
@Yaenu109311 ай бұрын
Has your video on binary search trees disappeared? Because you mention that you've talked about them previously, but I can't find a video about them on your channel
@MichaelSambol11 ай бұрын
I just have one on search: kzbin.info/www/bejne/nHWueqOImp16jZY. See here for the full list: github.com/msambol/dsa.
@Yaenu109311 ай бұрын
@@MichaelSambol My bad, i was searching for "tree". Thanks for your response