Lecturer
linked list is a data structure used for storing collections of data.
A linked list has the following properties:
1. Successive elements are connected by pointers.
2. The last element points to NULL.
3. Can grow or shrink in size during execution of a program.
4. Can be made just as long as required (until systems memory exhausts).
5. Does not waste memory space. It allocates memory as list grows.
Material File