When we do not know how much amount of memory would be needed for the program beforehand.
When we want data structures without any upper limit of memory space.
When you want to use your memory space more efficiently.
Dynamically created lists insertions and deletions can be done very easily just by the manipulation of addresses whereas in the case of statically allocated memory insertions and deletions lead to more movements and wastage of memory.
When you want to use the concept of structures and linked lists in programming, dynamic memory allocation is a must
