Difference between Singly Linked Circular List and Doubly Linked Circular List

 

SINGLE LINKED  CIRCULAR LIST

1)The structure of a node of singly linked  circular list is as follows:-

      Struct list_type

       {

           Int data;

         Struct list_type *next;

      }

 

Linked Lists in C

 

Lists

      1  LINK OR POINTER: A pointer also called a link or a reference, is defined to be a variable that give the location of some other variable(point to the next consecutive node), typically of a structure containing data.

 

Creation,Insertion ,Deletion algorithms of a Linked List

 

Algorithm  of creation of a Linked List

CREATE---In this algorithm a Linked List of nodes is created. The list is pointed by pointer first, the last node of the list points to NULL., indicating the end of the list.

Doubly Linked List

In Doubly linked list, we can store in each node not only the address of next node but also the address of the previous node in the linked list.

Reverse a Linked List

Reversing  a Linked list is the useful operation in which we change next to prev, prev to current and current to next.

  •  Start 
  •  Prev 
  •  1  2 
  •  Next 
  •  End 

Page 1 of 2