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

Discussion

pic
Editor guide
Collapse
jacobherrington profile image
Collapse
thejoezack profile image
Joe Zack

That intro gets me every time!

Collapse
ben profile image
Ben Halpern

It's so typical for programmers to try and make the B stand for so many things instead of just picking something

Collapse
ben profile image
Ben Halpern

...Naming things is hard

Collapse
nickytonline profile image
Nick Taylor (he/him)

and LOL