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 |
Is data structure a data type?
What is hash data type?
What exactly is a thread?
Why is hashing used?
Is there any difference between int[] a and int a[]?
Explain what is B-tree?
What are the disadvantages of sequential storage?
How does a hashtable work?
What is the time complexity of arraylist and linked list?
What does sorting an array do?
What is bubble insertion selection sort?
In what areas do data structures applied?