
Designing Data-Intensive Applications – To B-Tree or not to B-Tree
Coding Blocks
00:00
How to Split a Page in Half?
The bee tree is a self balancing data structure. It splits itself into two full halves as it tries to balance its key and value. The root of the tree has a depth of n, which is kind of like thit means it's not huge by the way. And again, covered in more detail in episode nine,. how the bee tree work specifically, how they can be used for other purposes.
Play episode from 40:50
Transcript



