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
There is a program which inserts and deletes node in a sorted singly linked list. There is a bug in one of the modules, how would you debug it?
How do you find the height of a binary tree?
What is the difference between null and void pointer in data structures?
What is array traversing?
Where is data structure used?
How does selection sort work?
Explain the Complete structure of hashmap along with the basic coding of the hashmap internal implementation.
Define non linear data structure.
Which collection class is thread safe?
Explain what is linear search?
State the difference between arrays and linked lists?
Can we use ordered set for performing binary search?
Write the syntax in c to create a node in the singly linked list.
How helpful is abstract data type of data structures?
What are different types of linked lists?
