Linked Lists
A linked list is a data structure which could alter during execution.
- Effective elements are connected by pointers.
- Final element points in order to NULL.
- It may develop or reduce in size during execution of a program.
- It may be created just as long as required.
- It does not waste memory space.
- Keeping track of a linked list:
- Must understand the pointer to the first element of the list (called start, head, etc.).
- Linked lists provide flexibility in allowing the items to be rearranged efficiently.
- Insert an element.
- Delete an element
Following Topic Related To Linked Lists Data Structure
Illustration: Insertion
Illustration: Deletion
Types Of Linked Lists
|
Math and Science
