Treap with implicit keys

Question

There\'s a data structure called treap: that\'s a randomized binary search tree, which is also a heap on randomly generated so-called \"priorities\".

There\'s a vari

Answer 1

I don't think there is a name for that data structure since it is simply a combination of two orthogonal concepts. You could use implicit keys like this with just about any self-balancing tree data structure.

You might want to take a look at Scapegoat trees, since they use the subtree size already for rebalancing and do not require any per-node overhead.