What are dynamic data structures?
Answers were Sorted based on User's Feedback
Answer / nashiinformaticssolutions
Data structures like linked lists and trees that grow or shrink during runtime.
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / glibwaresoftsolutions
The ability to grow and shrink while a program executes is a property of dynamic data structures. Because it adapts to the scale of the data to be edited, it offers a particularly versatile technique of data manipulation.
| Is This Answer Correct ? | 0 Yes | 0 No |
What will you prefer for traversing through a list of elements between singly and doubly linked lists?
what is Singly Linked list?
List the applications of set adt?
How do you increase the capacity of an arraylist?
what is mean by d-queue?
What is map keyset?
Why is quicksort unstable?
What is the difference between hashmap and linkedhashmap?
What are the benefits of using arrays?
Can we create a null as a key for a map collection?
Is binary tree a bst?
What will be the output of below code?