What is dynamic data structure?
- 1 Answers
- 991 Views
- I also Faced
- E-Mail Answers
A dynamic data structure (DDS) refers to an organization or collection of data in memory that has the flexibility to grow or shrink in size, enabling a programmer to control exactly how much memory is utilized.
| Is This Answer Correct ? | 0 Yes | 0 No |
Define ancestor and descendant ?
How can avl tree be useful in all the operations as compared to binary search tree?
What is the purpose of tochararray ()?
Which is faster hashmap or treemap?
Write a program for Sorting an Array. Which sorting will you prefer?
Explain linear linked implementation of Stack and Queue?
How to find if linked list has loop?
What are linked lists used for?
What is the complexity of arrays sort?
Is binary tree a binary search tree?
What is data type in data structure?
Why quicksort is better than merge sort?
Windows 
