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
What is a stable sort?
Does hashmap preserve insertion order?
Which sort algorithm is best?
Compare Queue and Topic ?
Is heap sort faster than quicksort?
Do you know how to find if linked list has loop?
What is the relationship between a queue and its underlying array?
What are the parts of a linked list?
What are the drawbacks of array implementation of queue?
What is a data structure node class?
How to show internal storage representation of data structure in RDBM?
What is the time complexity of arraylist and linked list?
What are the Differences between map and hashmap?
Is unordered_map a hash table?
For searches. Which one is most preferred: array list or linked list?
