posts: treap-revisited: add implementation
This commit is contained in:
parent
21fbc24e02
commit
19b535ce49
|
@ -27,3 +27,12 @@ rather than the fiddly process of deletion using tree rotations.
|
||||||
[rb]: https://en.wikipedia.org/wiki/Red%E2%80%93black_tree
|
[rb]: https://en.wikipedia.org/wiki/Red%E2%80%93black_tree
|
||||||
|
|
||||||
<!--more-->
|
<!--more-->
|
||||||
|
|
||||||
|
## Implementation
|
||||||
|
|
||||||
|
All operations on the tree will be implemented in terms of two fundamental
|
||||||
|
operations: `split` and `merge`.
|
||||||
|
|
||||||
|
We'll be reusing the same structures as in the last post, so let's skip straight
|
||||||
|
to implementing those fundaments, and building on them for `insert` and
|
||||||
|
`delete`.
|
||||||
|
|
Loading…
Reference in a new issue