Differentiate between priorityqueue and treeset.
- 1 Answers
- 1296 Views
- I also Faced
- E-Mail Answers
Answer / Nishant Singh
PriorityQueue and TreeSet are data structures used for different purposes:
1. Implementation:n - PriorityQueue is an ordered collection where each element has a priority or key associated with it.n - TreeSet is a self-balancing binary search tree that stores unique elements in sorted order.
2. Operations:n - PriorityQueue offers methods for adding and removing elements based on their priorities, such as add(), remove(), and poll().n - TreeSet provides operations for inserting, deleting, and searching elements based on their values, such as add(), remove(), and contains().
3. Sorted Order:n - PriorityQueue maintains the elements in the order of their priorities, which may not necessarily be the natural ordering.n - TreeSet maintains the elements in their natural ordering by default or a custom comparator if provided.
| Is This Answer Correct ? | 0 Yes | 0 No |
What is the use of threaded binary tree?
In what areas do data structures applied?
ple.. briefly describe the purpose of having a base case and a recursive case in a recursive algorithm
How would you dynamically allocate a one-dimensional and two-dimensional array of integers?
How do you separate zeros from non-zeros in an array?
What are hash tables good for?
What is the time complexity of arrays sort?
What is sort order?
Is quicksort faster than merge sort?
What is nsmutablearray?
Complete structure of hashmap, very detail description, along with the basic coding of the hashmap internal implementation.
How many sorting techniques are there?
Windows 
