Which is faster treemap or hashmap?
- 1 Answers
- 975 Views
- I also Faced
- E-Mail Answers
Answer / Bachchu Pandit
The performance of TreeMap and HashMap can vary depending on the use case. HashMap provides constant-time O(1) average performance for basic operations like get, put, and remove, while TreeMap performs sorted insertions and maintains an ordered collection, with a logarithmic time complexity for these operations.
| Is This Answer Correct ? | 0 Yes | 0 No |
What do you mean by breadth first search (bfs)?
What is time complexity of hashmap?
What type of memory allocation is referred for Linked lists?
Describe full binary tree and complete binary tree.
How to fill element (initialize at once) in an array?
How many pointers are necessary to implement a simple linked list?
What are the difference between a stack and a queue?
Which data structure is used in arraylist?
Which sorting algorithm is worst?
What is difference between while and do while?
Define an algorithm.
What is fibonacci search?
Windows 
