Hello,
is anybody interested in sponsoring me on exploring a wavl tree
implementation of TreeMap [1]?
For some reason related to gmail, I'm not able to get messages targeted
to the mailing list alone, so please cc: me as well.
Greetings
Raffaello
(Here are some highlights of wavl trees:
* worst case height when built without deletions: ~1.4404 lg n
* worst case number of rotations for a deletion: 2
As a comparison, the same figures for red-black trees:
* worst case height when built without deletions: ~2 lg n
* worst case number of rotations for a deletion: 3
Other measures are like those of red-black trees or better.)
----
[1]
http://mail.openjdk.java.net/pipermail/core-libs-dev/2019-December/063737.html
