[Treap] Fast random insertions/deletions collection

Hi!

Working on one of my projects, I realised that there is no data structure that can address random insertions. I implemented implicit treap for this purpose that behaves like a general Array. It has O(log n) complexity for insert / remove / access.

I believe that it would be nice to see this kind of structure in the package.

3 Likes
Terms of Service

Privacy Policy

Cookie Policy