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...
Follow Byte Sized for an adventure through computer history, a few minutes at a time. More great episodes to come.
Today's Sponsor
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