5,337
edits
Data Structures: Difference between revisions
→Treap
(→B-tree) |
(→Treap) |
||
| Line 59: | Line 59: | ||
===Treap=== | ===Treap=== | ||
A tree and a heap. O(logn) with high probability. | A tree and a heap. O(logn) with high probability. | ||
The main benefits are that it is very easy to implement. | |||
====Insertion==== | ====Insertion==== | ||
Insert using BST insert and then heapify using AVL rotations. | Insert using BST insert and then heapify using AVL rotations. | ||
===Splay Tree=== | ===Splay Tree=== | ||