Difference between hashset and treeset?
- 1 Answers
- 1161 Views
- I also Faced
- E-Mail Answers
Answer / Kumari Arunima
HashSet uses a hash table for storage, allowing constant-time average performance for basic operations. TreeSet uses a red-black tree, ensuring that the elements are sorted in ascending order (by default). HashSet allows null elements while TreeSet does not.
| Is This Answer Correct ? | 0 Yes | 0 No |
What is the non linear data structure?
Differentiate between list and map.
Is radix sort faster than quicksort?
In rdbms, explain what is the efficient data structure used in the internal storage representation?
What is the need for priority queue?
A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute?
Define dynamic data structures?
How does a treemap sort?
How to reverse a singly linked list?
How do we search a specific element in an array?
Which programming language is best for data structures?
Explain how is linked list implemented?
Windows 
