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
Can we remove element from arraylist while iterating?
Write an algorithm to find middle element in the linked list.
what are the applications that use Linked lists?
State the difference between arrays and linked lists?
What is bubble sort and selection sort?
Define balance factor of a node in avl tree?
What are the advantages of selecetion sort?
State the demerits of linked representation of binary trees?
What do u mean by array?
Explain binary searching and Fibinocci search?
How does quicksort partition work?
How would you use bsearch() function to search a name stored in array of pointers to string?
Why is arraylist faster than linkedlist?
Mention for which header list, you will found the last node contains the null pointer?
Is an arraylist a vector?
