Can anyone give me references of a web site containing a summary of the main Java data structures, and their respective complexity in time (for some given operations like ad
Time and space complexities for the main collection classes should correspond to data structures known time complexity. I don't think there's anything Java specific about it, e.g. (as you say) hash lookup should be O(1). You could look here or here.