DEV Community

0 seconds of 0 secondsVolume 90%
Press shift question mark to access a list of keyboard shortcuts
00:00
00:00
00:00
 
Vaidehi Joshi for Byte Sized

Posted on

60 18

Byte Sized Episode 5: Birth of the B-tree

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

Please leave your appreciation by commenting on this post!

Let's go

Top comments (5)

Collapse
 
jacobherrington profile image
Jacob Herrington (he/him)

👋 hi Ruby 🐶

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

and LOL

👋 Kindness is contagious

Engage with a sea of insights in this enlightening article, highly esteemed within the encouraging DEV Community. Programmers of every skill level are invited to participate and enrich our shared knowledge.

A simple "thank you" can uplift someone's spirits. Express your appreciation in the comments section!

On DEV, sharing knowledge smooths our journey and strengthens our community bonds. Found this useful? A brief thank you to the author can mean a lot.

Okay