loading...
Play Button Pause Button
Byte Sized

Byte Sized Episode 5: Birth of the B-tree

vaidehijoshi profile image Vaidehi Joshi ・1 min read

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.

bytesized image

Today's Sponsor

Posted on by:

vaidehijoshi profile

Vaidehi Joshi

@vaidehijoshi

Writing words, writing code. Sometimes doing both at once. Señiorita engineer at Forem.

Byte Sized

Nibble on coding history with Vaidehi Joshi

Discussion

pic
Editor guide
 
 

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