Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / d.balakrishnan
Data Structure is ways to store data, search data, and
retrieve it. It use is to optimize data storage and the
ability to access it. It include things like list and trees.
So, basically some data structures are better for certain
kinds of data. In that it allows you to pull data quicker
faster. Algorithms are based on there speed to access the data.
| Is This Answer Correct ? | 3 Yes | 3 No |
Post New Answer View All Answers
How can we reverse the order in the treemap?
How do you access the values within an array?
What is difference between set and map?
How do you perform a merge sort?
Why insertion is faster in linked list?
How can you correct these errors?
How can we reverse a singly linked list?
What are the types of queues?
For searches. Which one is most preferred: array list or linked list?
Explain the priority queue?
What are priority queues?
How arraylist increase its size?
What is thread and types of thread?
Does hashmap maintain insertion order?
How does a dynamic array work?
