DS Module -II - SLL

 

SLL

#include<stdio.h>

#include<stdlib.h>

struct node

{

int info;

struct node *next;

};

struct node *start;

void insend(int ele);

void insbeg(int ele);

void insmiddle(int ele);

void delend();

void delbeg();

void delmiddle();

void traverse();

void main()

{

            int ele,choice;

            start=NULL;

while(1)

{

            clrscr();

            printf("\t\t list operations\n");

            printf("1.insbeg\n");

            printf("2.insend\n");

            printf("3.insmiddle\n");

            printf("4.delbeg\n");

            printf("5.delend\n");

            printf("6.traverse\n");

            printf("7.delmiddle\n");

            printf("8.exit\n");

            printf("enter choice\n");

            scanf("%d",&choice);

            switch(choice)

            {

            case 1:printf("\n enetr ele ");

                                    scanf("%d",&ele);

                                    insbeg(ele);

                                    break;

            case 2:printf("\n enetr ele ");

                        scanf("%d",&ele);

                        insend(ele);

                        break;

            case 3:printf("\n enetr ele ");

                        scanf("%d",&ele);

                        insmiddle(ele);

                        break;

            case 4:delbeg();

                        break;

            case 5:delend();

                        break;

            case 6:traverse();

                        break;

            case 7:delmiddle();

                        break;

            case 8:exit(0);

            }

}

}

void insbeg(int ele)

{

            struct node *temp;

            temp=(struct node*)malloc(sizeof(struct node));

            temp->info=ele;

            if(start==NULL)

            {

                        temp->next=NULL;

                        start=temp;

            }

            else if(start->next==NULL)

            {

                        temp->next=start;

                        start=temp;

            }

            else

            {

                        temp->next=start;

                        start=temp;

            }         

}

void insmiddle(int ele)

{

            struct node *temp,*p;int pos,count=0;

            if(start==NULL)

            {

                        temp=(struct node*)malloc(sizeof(struct node));

                        temp->info=ele;

                        temp->next=NULL;

                        start=temp;

            }

            else

            {

                        temp=(struct node*)malloc(sizeof(struct node));

                        temp->info=ele;

                        printf("\n enter position");

                        scanf("%d",&pos);

                        p=start;

                        while(p!=NULL)

                        {

                                    if(pos==count)

                                    break;

                                    count=count+1;

                                    p=p->next;

                        }

                        temp->next=p->next;

                        p->next=temp;

            }

}

void insend(int ele)

{

            struct node *temp,*p;

            temp=(struct node*)malloc(sizeof(struct node));

            temp->info=ele;

            temp->next=NULL;

            if(start==NULL)

            {

                        start=temp;

            }

            else if(start->next==NULL)

            {

                        start->next=temp;

            }

            else

            {

                        p=start;

                        while(p->next!=NULL)

                        {

                                    p=p->next;

                        }

                        p->next=temp;

            }

}

void delbeg()

{

            struct node *temp;

            if(start==NULL)

            printf("\n list is empty");

            else if(start->next==NULL)

            {

                        temp=start;

                        start=NULL;

                        free(temp);

            }

            else

            {

                        temp=start;

                        start=start->next;

                        free(temp);

            }

}

void delend()

{

            struct node *temp,*p;

            if(start==NULL)

            printf("\n list is empty");

            else if(start->next==NULL)

            {

                        temp=start;

                        start=NULL;

                        free(temp);

            }

            else

            {

                        p=start;

                        while(p->next->next!=NULL)

                        {

                                    p=p->next;

                        }

                        temp=p->next;

                        p->next=NULL;

                        free(temp);

            }

}

void traverse()

{

            struct node *p;

            if(start==NULL)

            printf("\n list is empty");

            else

            {

                        p=start;

                        while(p!=NULL)

                        {

                                    printf("\n elements are %d",p->info);

                                    p=p->next;

                        }

            }

            getch();

}

void delmiddle()

{

}

Comments

Post a Comment

Popular posts from this blog

ML QP

  Machine Learning Lab External 1. a) Create a small dataset with at least 10 records and 4 columns: ·          Age (numeric) ·          Height (numeric) ·          Weight (numeric) ·          City (categorical, with possible values: "City A", "City B", "City C")    b) Ensure that some entries in the Age and Weight columns contain missing values. ·          Handle missing data by: o    Replacing missing values in the Age column with the average age . o    Replacing missing values in the Weight column with the median weight .    c) Normalize the Age , Height , and Weight columns using min-max scaling to bring       all values between 0 and 1.    d) Display the original dataset, th...
Read more

Data Structures Module_V

  Module – V   1. Binary Tree Traversals using Linked List Inorder: #include <stdio.h> #include <stdlib.h>   struct Node {     int data;     struct Node* left;     struct Node* right; };   // Function to perform inorder traversal void inorderTraversal(struct Node* root)  {       // Empty Tree     if (root == NULL)         return;       // Recur on the left subtree     inorderTraversal(root->left);       // Visit the current node     printf("%d ", root->data);       // Recur on the right subtree     inorderTraversal(root->right); }   // Function to create a new node struct Node* newNode(int data)  {       struct Node* node = (struct Node*)malloc(size...
Read more

Data Structures Module-IV

  Module-IV 1) Implementation of Queue Operations using                      i) Arrays    ii) Linked List 2) Implementation of Circular Queue Operations using                      i) Arrays    ii) Linked List 3) Implement Dequeue using Linked List.   1) a) Implementation of Queue Operations using Arrays. #include<stdio.h> #include<stdlib.h> #define SIZE 5 void enqueue(); void dequeue(); void display(); int queue[SIZE],front=-1,rear=-1,ele; int main() {     int ch;     while(1)     {     printf("\n menu");     printf("\n 1.enqueue\n 2.dequeue\n 3.display");     printf("\n enter ur choice");     scanf("...
Read more