~hackernews | Bookmarks (1)

clear filters

data structures ×

Implementing a B-Tree in Go

cloudcentric.dev

The B-Tree is a self-balancing search tree data structure that allows for efficient insertion, deletion, and...
The B-Tree is a self-balancing search tree data structure that allows for efficient insertion, deletion, and retrieval operations in logarithmic time while keeping all data in sorted order. B-Trees were developed by computer scientists Rudolf Bayer and Edward M. McCreight at Boeing Scientific Research Laboratories t...

data structures golang
1