Answer Posted / hrpynux@gmail.com
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 |
Post New Answer View All Answers
What is a B tree?
What are the types of sorting?
What is top in stack?
How to find middle element of linked list in one pass?
What do you mean by priority queue?
How would you use qsort() function to sort the name stored in an array of pointers to string?
What is bubble sort?
Why we use linked list?
What do you mean by 2-3-4 tree?
What is the use of data structure?
What is stack in data structure with the example?
Give one example of right rotation.
What is the height of an empty tree?
What do you mean by quadratic probing?
Why is bubble sort stable?
