From 19b535ce49d70e1099a39e764d38ca0f79a0f5dd Mon Sep 17 00:00:00 2001 From: Bruno BELANYI Date: Sat, 27 Jul 2024 18:31:47 +0100 Subject: [PATCH] posts: treap-revisited: add implementation --- content/posts/2024-07-27-treap-revisited/index.md | 9 +++++++++ 1 file changed, 9 insertions(+) diff --git a/content/posts/2024-07-27-treap-revisited/index.md b/content/posts/2024-07-27-treap-revisited/index.md index c9c01bc..f188568 100644 --- a/content/posts/2024-07-27-treap-revisited/index.md +++ b/content/posts/2024-07-27-treap-revisited/index.md @@ -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 + +## 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`.