Linked List

Linked List

1. Why use linked list over arrays?

   • All the nodes of linked list are non-contiguously stored in the memory and linked together with the help of pointers.
   • Sizing is no longer a problem since we do not need to define its size at the time of declaration.
   • It allocates the memory dynamically.

2. Uses of linked list

   • We can store values of primitive types or objects in the singly linked list.
   • Linked Lists are very useful in dynamic memory allocation
   • list size is limited to the memory size

3. What is linked list?

   • Linked List can be defined as collection of objects called nodes that are randomly stored in the memory.
   • A node contains two fields i.e. data and the pointer which contains the address of the next node in the memory.
   • The last node of the list contains pointer to the null.

4. Types of Linked list

   • Singly Linked list
   • Doubly Linked list
   • Circular Liked List