Tali

12%
Flag icon
a B-tree with n keys always has a depth of O(log n).
Designing Data-Intensive Applications: The Big Ideas Behind Reliable, Scalable, and Maintainable Systems
Rate this book
Clear rating
Open Preview