Today's episode of Byte Sized is about the B-tree. In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time.
You can find more info about b-trees here...
![vaidehijoshi image](https://res.cloudinary.com/practicaldev/image/fetch/s--7B5N_sEK--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_66%2Cw_880/https://res.cloudinary.com/practicaldev/image/fetch/s--2Mba1moc--/c_fill%2Cf_auto%2Cfl_progressive%2Ch_150%2Cq_66%2Cw_150/https://dev-to-uploads.s3.amazonaws.com/uploads/user/profile_image/2882/872cbd01-815a-4e1f-94dc-5e432b8c8974.gif)
Busying Oneself With B-Trees
Vaidehi Joshi ・ Sep 23 '17 ・ 16 min read
Follow Byte Sized for an adventure through computer history, a few minutes at a time. More great episodes to come.
Top comments (5)
👋 hi Ruby 🐶
That intro gets me every time!
It's so typical for programmers to try and make the B stand for so many things instead of just picking something
...Naming things is hard
and LOL