Compare commits
8 commits
e3caffa453
...
40dd12c50a
Author | SHA1 | Date | |
---|---|---|---|
Bruno BELANYI | 40dd12c50a | ||
Bruno BELANYI | 8f91d00418 | ||
Bruno BELANYI | 9f39a62771 | ||
Bruno BELANYI | 08959bacfa | ||
Bruno BELANYI | 782d4c94c6 | ||
Bruno BELANYI | 7eb96b11ea | ||
Bruno BELANYI | dec1e79b5c | ||
Bruno BELANYI | 6d7b2cce11 |
|
@ -21,7 +21,7 @@ The [_Treap_][wiki] is a mix between a _Binary Search Tree_ and a _Heap_.
|
|||
Like a _Binary Search Tree_, it keeps an ordered set of keys in the shape of a
|
||||
tree, allowing for binary search traversal.
|
||||
|
||||
Like a _Heap_, it keeps associates each node with a priority, making sure that a
|
||||
Like a _Heap_, it associates each node with a priority, making sure that a
|
||||
parent's priority is always higher than any of its children.
|
||||
|
||||
[wiki]: https://en.wikipedia.org/wiki/Treap
|
||||
|
|
Loading…
Reference in a new issue