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
Differentiate between the singly linked list and doubly linked list.
State the difference between persistent and ephemeral data structure?
What are the tasks performed during postorder traversal?
What is a tech stack?
What is int data type?
How will you sort the elements of array in descending order?
What is array and structure?
What are skew trees? For a tree with 4 nodes draw all possible binary? Generalize for n nodes how many binary trees can be drawn?
What is a dequeue?
Explain the Stack
What is a singletonlist?
What do you mean by level of the tree?
Which is faster hashmap or linkedhashmap?
What is treemap chart?
What is a stable sort?