Question

Describe dynamic data structure in C programming language?

Answer 1

ıllıllı ʜᴇʀᴇ ɪs ʏᴏᴜʀ ᴀɴsᴡᴇʀ ıllıllı

Dynamic data structure is more efficient to the memory. The memory access occurs as needed by the program.

ᴇʜsᴀss  ✿◕ ‿ ◕✿

Answer 2

Dynamic data structures are data structuresthat grow and shrink as you need them to by allocating and deallocating memory from a place called the heap. ... Dynamic data structures allocate blocks of memory from the heap as required, and link those blocks together into some kind of data structureusing pointers.