B-trees in 4 minutes — Intro
117,651
Published 2022-07-22
Code: github.com/msambol/dsa/blob/master/trees/b_tree.py
Source: Introduction To Algorithms, Third Edition (CLRS) [www.amazon.com/Introduction-Algorithms-3rd-MIT-Pre…]
LinkedIn: www.linkedin.com/in/michael-sambol
All Comments (16)
-
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!
-
Your videos are absolutely THE best about different BSTs, super easy to understand, thank you!
-
Thank you for all videos. this playlist is very helpful
-
You are a lifesaver Thank you so much
-
Thank you! That was so clear!
-
Thank you so mụch! Your video is very helpful and easy to understand 🥰
-
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.
-
Thank u for info
-
Thank you
-
Good video.
-
I love you thanks
-
Thank you, Mr Michael. Cheers from a fellow educator/teacher! BTW, 400 USD for an extra 32 GB? Apple is Apple, after all haha.
-
Great
-
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
-
400 bucks for 1tb LOL
