Has somebody used data structures like AVL tree or a hash table in an J2ME application ?
Could you say to me if memory consume of the AVL or the hash table is too great for the limited memory of a mobile?
thanks
Its what you put in a data structure that largely determines its memory consumption - not the structure itself.
Currently devices range from a few 100kb, to several megabytes of heap.
You can work out the rest yourself.
Ok, Thanks 