Types of Linked list

• Singly List

  In a SLL, each element points to its next element. The last element points to a NULL pointer. Each element consists of two fields - data and link. Hence each element is called as a node.

  The first node is indicated by a pointer called "start". SLL allows traversal only in forward direction .

  Links :

  • Algorithms

  • Insertion of the new element

  • Inserting at the End

  • Inserting at the specified position

  • Traverse

  • Searching element

  • Delete perticular element

  • Count the number of elements

  

  

  

  ---

  • Algorithms

  

  

  ---

  • Insertion of new element

  

  

  ---

  • Insertion at the end

  

  

  ---

  • Insertion at specified position

  

  

  ---

  • Traverse

  

  

  ---

  • Searching

  

  

  ---

  • Delete perticular an element

  

  

  

  ---

  • Count the num of elements

  

• Doubly List

  In a DLL, each node points towards 2 nodes, one on the forward side and other on the reverse side.

  The only element in reference will be the first element. DLL traverse in both directions.

  ---

  Links :

  • Algorithms

  • Inserting a new element at the end

  • Inserting at specified position

  • Traverse

  

  ---

  • Algorithms

  

  

  

  ---

  • Insertion at the end

  

  

  ---

  • Insertion at specified position

  

  

  

  ---

  • Traverse through double link list

  

  ---

  • Searching

  

  

  

  ---

  • Delete a perticular element

  

  

• Circular List

  The CLL is similar to SLL, i.e each element points to its next element, while the last element points to the first element. In a CLL, if atleast 1 element is present, then there is no concept of NULL pointer.

  NULL pointer comes into existence only if there are zero elements in the CLL. In a CLL, the last element is the reference pointer for the programmer.

  • To display the element