5,337
edits
Data Structures: Difference between revisions
→2-3
(→2-3) |
|||
| Line 46: | Line 46: | ||
<math>O(\log n)</math> insert, delete | <math>O(\log n)</math> insert, delete | ||
===2-3=== | ===B-tree=== | ||
[[Wikipedia: B-tree]] | |||
A very popular data structure for filesystems and memory indexes since the maximum size of a node in the B-tree can be configured to the size of a page of memory. | |||
====2-3==== | |||
A 2-3 tree of order 3 | |||
====Variants==== | |||
* B+ | |||
* B* | |||
===Treap=== | ===Treap=== | ||
A tree and a heap. O(logn) with high probability. | A tree and a heap. O(logn) with high probability. | ||