Compare commits

..

8 commits

Author SHA1 Message Date
Bruno BELANYI 40dd12c50a posts: gap-buffer: fix typo
All checks were successful
ci/woodpecker/push/deploy/2 Pipeline was successful
2024-07-20 19:28:16 +01:00
Bruno BELANYI 8f91d00418 posts: union-find: fix typo 2024-07-20 19:28:16 +01:00
Bruno BELANYI 9f39a62771 Add Treap post 2024-07-20 19:28:16 +01:00
Bruno BELANYI 08959bacfa posts: treap: add insertion 2024-07-20 19:28:16 +01:00
Bruno BELANYI 782d4c94c6 posts: treap: add search 2024-07-20 19:28:16 +01:00
Bruno BELANYI 7eb96b11ea posts: treap: add construction 2024-07-20 19:28:16 +01:00
Bruno BELANYI dec1e79b5c posts: treap: add presentation 2024-07-20 19:28:16 +01:00
Bruno BELANYI 6d7b2cce11 posts: add treap 2024-07-20 19:28:16 +01:00

View file

@ -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