![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645186493433-Hashset%20linkedhashset_Artboard%201.png\")
<\/p>\n<\/p>\n
We all have been using HashSet<\/strong>, LinkedHashSet<\/strong>, and TreeSet<\/strong> in Java. But do you know what are the differences between them and how they all are similar too in some ways?<\/p><\/p>\n To gain more knowledge about these data structures, let\u2019s discuss their differences and similarities below. <\/p>\nDifferences:<\/h4>\n\n
Discussion Point<\/th> HashSet<\/th> LinkedHashSet<\/th> TreeSet<\/th><\/tr><\/thead> Data Structure used
internally<\/td>Uses HashMap\u00a0<\/td> Uses LinkedHashMap<\/td> Uses TreeMap<\/td><\/tr> Order if elements<\/td> Doesn\u2019t maintain the order
of insertion and stores
unique elements<\/td>Maintains insertion order
of elements<\/td>Stores elements in sorted
order
(ascending by default),
which can be defined using
a custom comparator.
<\/td><\/tr>Time complexity of
operations<\/td>Takes O(1) for insertion,
updating, and deletion<\/td>Takes O(1) for insertion,
updating, and deletion<\/td>Takes O(log(n)) for
insertion, updating and
deletion<\/td><\/tr>Null value handling<\/td> Allows only one null value<\/td> Allows only one null value<\/td> Doesn\u2019t allow null value.
Will throw
NullPointerException upon
insertion of null value.<\/td><\/tr>How to use (syntax)<\/td> HashSet a = new
HashSet();<\/td>LinkedHashSet a = new
LinkedHashSet();<\/td>TreeSet a = new TreeSet();<\/td><\/tr> Performance<\/td> Has better performance
when compared to
LinkedHashSet and
TreeSet.<\/td>Performs slower than
TreeSet. And almost similar
to HashSet but slower
because it internally
maintains LinkedList to
maintain the insertion
order of elements.<\/td>Performs better than
LinkedHashSet except for
insertion and removal
operations because it has
to sort the elements after
each insertion and removal
operation.<\/td><\/tr><\/tbody><\/table><\/figure>\n\nSimilarities:<\/h4>\n