Hi,

I'd like to write an applet, which will create many objects (all of the
same type) , which can be identified by two integers X and Y.

At a later moment I'd like to retrieve the previously created /
calculated object by specifying it's X and Y value.

I think, that a B-tree might be the right data structure for storing my
data, as I will continiously add / search / remove elements.

Instead of implementing one more version of a B-Tree or a similiar
structure I wanted to know whether there are already good open source
libraries, that implement such data structures (B-Tree / linked list /
hash / sort )

thanks a lot for any pointers

N