Repository Details
Shared by
HelloGitHub Rating
0 ratings
B-Tree Data Structure Implemented in Go Language
Past 7 days Received -2 stars ✨
Use arrow keys to explore dates, Home and End for the first and last date, Escape to dismiss.| Date | Star | Daily change |
|---|---|---|
| 周二 | 4,160 | — |
| 周三 | 4,160 | 0 |
| 周四 | 4,160 | 0 |
| 周五 | 4,159 | -1 |
| 周六 | 4,159 | 0 |
| 周日 | 4,159 | 0 |
| 周一 | 4,158 | -1 |
4.2k
Stars
No
Chinese
Go
Language
No
Active
14
Contributors
15
Issues
Yes
Organization
None
Latest
427
Forks
Apache-2.0
License
An open-source implementation of the B-Tree data structure in Go language by Google. The code is clean and well-commented, making it highly recommended for reading the source code. The B-Tree data structure enables data lookup, sequential access, insertion, and deletion operations to be completed in logarithmic time, and is widely used in databases and file systems.
Comments
Rating:
No comments yet