Data Strucrures



  Template for SLL   Singly Linked List   Stack Using Linked List   Operations on Linked List   Queue Using Linked List   Double Linked List   Polynomial using Linked List   Generalize Linked List
  Tree Terminologies   Binary Tree   Binary Tree Traversals   Binary Search Tree Traversals   Binary Search Tree Operations
  Introduction   Graph Traversals   Minimum Spanning Tree   Graph Representation
  Hash Table Operations


Operations on Linked List

   Linear Search and Binary Search PPT
Prev Post
Next Post

Linked listis a linear data structure in which each node is divided into two parts, one is data and other is address or link to store address of next node.

The operations on linked list are as follows;

  • Create New Node
  • Traversing a linked list
  • Creation of Linked List
  • Displaying a Linked List
  • Search New node from Linked List
  • Add New Node at End
  • Add New Node in between the list
  • Add New Node at Begning
  • Delete Node form Linked List

Before moving towards operations on linked list, let we see the declarations which are necessary for the above functions.

struct node *create(struct node *);
void display(struct node *);
struct node *getnode(int);
struct node *findlast(struct node *);
struct node *add_at_begin(struct node*);
void add_at_end(struct node *);
void add_in_between(struct node *);
void search(struct node *);
struct node *delet(struct node *);

Operations:

1. Creation of New Node

To create new node, take one external pointer called temp and finally return temp pointer.

struct node *getnode(int item)
{    
         struct node *temp;    
         temp=(struct node*)malloc(sizeof(struct node));    
         temp->data=item;    
         temp->link=NULL;    
         return(temp);
}

2. To Traverse List or To find Last Node

To traverse a linked list, first take one external pointer and assign that pointer to start node and traverse pointer called ptr till end of list using condition ptr!=NULL

struct node *findlast(struct node *start)
{    struct node *ptr;    
     for(ptr=start;ptr->link!=NULL;ptr=ptr->link);    
     return(ptr);
}


3. Create Singly Linked List

To create a Singly Linked List, use following code

struct node *create(struct node *start)
{    
      struct node *ptr,*temp;    
      int item;    
      char ch;    
      do    
      {        
             printf("\nEnter Node Valude : ");        
             scanf("%d",&item);        
             temp=getnode(item);        
             if(start==NULL)            
                     start=temp;        
             else        
             {            
                       ptr=findlast(start);            
                       ptr->link=temp;        
             }        
             printf("\nWant to Enter one more element : ");        
             scanf("%s",&ch);    
       }while(ch=='y');            
       return(start);
}

4. Display Singly Linked List

To display linked List, use following code

void display(struct node *start)
{    
       struct node *ptr;    
       for(ptr=start;ptr!=NULL;ptr=ptr->link)        
                 printf("%d    ",ptr->data);
}


5. Search node from Linked List

void search(struct node *start)
{    
       struct node *ptr;    
       int value;    
       printf("\nEnter node to search : ");    
       scanf("%d",&value);    
       for(ptr=start;ptr!=NULL && ptr->data!=value;ptr=ptr->link);    
       printf("Searched Node is = %d",ptr->data);
}


6. Append New Node at Begin.

struct node *add_at_begin(struct node *start)
{    
        struct node *temp;    
        int item;    
        printf("\nEnter Node Valude : ");    
        scanf("%d",&item);    
        temp=getnode(item);    
        temp->link=start;    
        start=temp;    
        return(start);
}


7. Append New Node at End.

void add_at_end(struct node *start)
{    
         struct node *temp,*ptr;    
         int item;    
         printf("\nEnter Node Valude : ");    
         scanf("%d",&item);    
         temp=getnode(item);    
         ptr=findlast(start);    
         ptr->link=temp;
}

8. Append New Node in between.

void add_in_between(struct node *start)
{    
         struct node *temp,*ptr;    
         int item,value;    
         printf("\nEnter Node Valude : ");    
         scanf("%d",&item);    
         temp=getnode(item);    
         printf("\nEnter node after which you want to Insert : ");    
         scanf("%d",&value);    
         for(ptr=start;ptr->data!=value;ptr=ptr->link);    
         temp->link=ptr->link;        
         ptr->link=temp;
}

        
9. Delete node from list

struct node *delet(struct node *start)
{    
        struct node *ptr=start,*prev;    
        int value;    
        printf("\nEnter node to be deleted : ");    
        scanf("%d",&value);    
        if (ptr!= NULL && ptr->data == value)    
        {        
                 start=start->link;        
                 free(ptr);    
         }     
        else    
        {        
                 for(ptr=start;ptr!=NULL && ptr->data!=value;prev=ptr,ptr=ptr->link);        
                 prev->link=ptr->link;        
                 free(ptr);    
         }    
         return(start);
}