B-trees are a popular data structure for storing large amounts of data, frequently seen in databases and file systems. But how do they really work? What makes them efficient? In this video, we explore the inner workings of the B-tree, aiming to understand the properties that make them useful and the elegant algorithms that make working with them possible.
***
Spanning Tree is an educational video series about computer science and mathematics. See more at https://spanningtree.me
To be notified when a new video is released, sign up for the Spanning Tree mailing list at https://spanningtree.substack.com/
You can support the Spanning Tree channel at https://ko-fi.com/spanningtree.
Spanning Tree is created by Brian Yu. https://brianyu.me/
Email me at brian@spanningtree.me to suggest a future topic.
