adspace


When do we use hashset over treeset?

Answer Posted / Shantanu Shukla

We use HashSet instead of TreeSet when the order of elements does not matter and performance is a concern, as HashSet has faster insertion and retrieval times compared to TreeSet due to its lack of ordering. However, if maintaining the order of elements (either ascending or descending based on natural ordering or custom Comparator) is important, we should use TreeSet.

Is This Answer Correct ?    0 Yes 0 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

Explain public static void main(string args[]) in java.

1084


What are the differences between heap and stack memory in java?

1151


Differentiate between static and non-static methods in java.

1131


How to sort array in descending order in java?

999


What is parsing in java?

1046


What do you mean by an interface in java?

1107


What is an object in java and how is it created?

1147


What is java string pool?

1088


Is minecraft 1.15 out?

1050


What is the difference between equals() and == in java?

1047


Write a program to print count of empty strings in java 8?

1092


What is the difference between break and continue statements?

1131


How to create a base64 decoder in java8?

1144


What is a constructor overloading in java?

1131


What is a classloader in java?

1096