Memory Allocation
practice.

Linked list is an example of linear data structure

Insertion and deletion of an element can be done at any position in a linked list

Linked list can be used to store a collection of homogenous and heterogeneous data types

The size of a linked list is fixed

Pointer pointing to non-existent memory location is called dangling pointer

When a dynamically allocated pointer references the original memory after it has been freed, a dangling pointer arises

If memory leak occurs, it is mandatory that a dangling pointer arises

Dangling pointer may result in segmentation faults and potential security risks