3 ms·
B-trees incrementally rebalance on every insert https://en.wikipedia.org/wiki/B-tree https://en.wikipedia.org/wiki/B-tree
by goialoq 9y ago
B-trees incrementally rebalance on every insert
https://en.wikipedia.org/wiki/B-tree https://en.wikipedia.org/wiki/B-tree
- KirinDave 9y agoI thought maybe I had made an error in writing or editing that implied that b-trees were not self-balancing. So I reread it twice. Maybe I just don't see where I implied otherwise. That doesn't mean that the amount of computation and memory comparisons done doesn't vary based on the order of the input.