Answer:
Some key points to remember, when handling the linked list are as follow:
- Linked list is the linear data structure in which each of the elements contain separate object.
- Linked list components are not store in a contiguous location.
- In the linked list the elements or components are basically use the pointers for linked with another elements.
- The last node of the linked list must contain null value.
- In the linked list, the allocation of the memory is equal to upper node limit.
