Java collections – performance (Time Complexity)
A set is a collection that contains no duplicate elements.
Add Next Contains Data StructureHashSet O(1) O(h/n) O(1) Hash TableEnumSet O(1) O(1) O(1) Bit VectorLinkedHashSet O(1) O(1) O(1) Hash Table+Linked ListTreeSet O(log n) O(log n) O(log n) Red-black treeConcurrentSkipList O(log n) O(1) O(log n) Skip ListCopyonWriteArraySet O(n) O(1) O(n) Array