Very interesting. Can you check in this work in a sandbox?
On Mar 1, 2008, at 5:59 AM, Kiran Ayyagari wrote:
> Below given are some of the numbers obtained by comparing the
> current implementation of AVL tree against the RB tree underlying
> the java.util.HashSet.
> Comparison of Insert operation in milli seconds
> No. of Nodes 1000 10,000 100,000
> HashSet 1 10 425
> AVLTree 18 68 624
> The time taken for both lookup and remove operations is same for
> both AVLTree and RBTree
> Configuration of my system is - 512MB RAM and Celeron processor
> (ThinkPad R51 running Ubuntu 6.06)
> Please suggest, should this be improved further?