linked list in data structure

what is linked list in data structure

 A linked list can be defined as collection of nodes.

Each node has two fields.

  1. Information field – it holds the value.
  2. Pointer to next node -` it contains the address of  next nodes.

Limitation of  linked  list

 The major  limitation of linked list is accessing to any obituary item is a title cumber  some   and time consuming.

 Types of linked list

   There   are  four types of linked list

  1.  Single link list OR linear link list
  2. Double ink list OR two way link list
  3.  Circular link list OR circular  double link list