Collection Framework

Set Interface and Implementing Classes - Differences

Classes HashSet LinkedHashSet TreeSet EnumSet

Usage Use when an Use when both Use when a Use when
unordered set insertion order sorted set with working with a
with fast access and fast access ordered elements set of enum
is required. are required. is required. constants.
Advantages - Fast element - Maintains - Maintains - Highly efficient
insertion and insertion order. elements in implementation
retrieval. sorted order. for enum
constants.
Disadvantages - Does not - Slower insertion - Slower insertion - Restricted to
maintain and deletion and deletion enums only.
insertion order. compared to compared to
HashSet. HashSet and
LinkedHashSet.
Important - Implements Set - Implements Set - Implements - Implements Set
Differences interface. - Uses interface. SortedSet interface.
a hash table for - Uses a hash interface - Uses a bit
storage. - table with linked - Uses a balanced vector for
Provides entries for tree (Red-Black storage.
constant-time storage. Tree) for storage. - Provides
performance for - Provides - Provides log(n) constant-time
basic operations- constant-time time complexity performance for
Not synchronized performance for for basic basic operations.
(not thread-safe). basic operations. operations. - Not
- Not - Not synchronized (not
synchronized (not synchronized (not thread-safe).
thread-safe). thread-safe).
Order No Maintains Sorted (Based on Based on Enum
Maintained Insertion Order Comparable) Declaration
Order
Handles Null Yes Yes No No
Values
Handles No No No No
Duplicates
Sorted Unsorted Unsorted Sorted Unsorted

Murali M