DSA_codes/DSA_2.cpp at main · IT-0824/DSA_codes · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<iostream>
using namespace std;

struct node{
    int data;
    struct node *next;
};
struct node* head;

void create(int n,struct node *&temp)
{
    temp=(struct node*)malloc(sizeof(struct node));
    temp->data=n;
    temp->next=NULL;


}

void insertail(int num){
    struct node*newnode;
    newnode=(struct node*)malloc(sizeof(struct node));
     newnode->data=num;
     newnode->next=NULL;
    //create(num,newnode);
    struct node*ptr=head;
    while(ptr->next!=NULL)
    {
        ptr=ptr->next;
        }
        ptr->next=newnode;
}

void insertbegin(int num){
    struct node* newnode;
    newnode=(struct node*)malloc(sizeof(struct node));
    // create(num,newnode);
   newnode->data=num;

    newnode->next=head;
    head=newnode;
}

void insertpos(int num,int key){
    struct node*ptr=head;
    struct node*newnode;
    create(num,newnode);
    while(ptr!=NULL){
        if(key==ptr->data)
        {
         newnode->next=ptr->next;
         ptr->next=newnode;
         break;
        }
        ptr=ptr->next;
    }
}

void delhead()
{
    struct node *ptr=head;
    head=head->next;
    free(ptr);
}

void deltail()
{
    struct node *ptr=head;
    while(ptr->next->next!=NULL)
    {
        ptr=ptr->next;
    }
    ptr->next=NULL;
}

void delpos(int key)
{
   struct node*ptr=head;
   while(ptr!=NULL){
       if(ptr->next->data==key)
       {
           struct node*p=ptr->next;
           ptr->next=ptr->next->next;
           free(p);
       }
       ptr=ptr->next;
   }
}

void display()
{

    struct node *p=head;
    while(p!=NULL){
        printf("%d -> ",p->data);
        p=p->next;
    }
    printf(" NULL \n");

}
int main()
{
    struct node *N;
   N=(struct node*)malloc(sizeof(struct node));

    create(1,N);
    head=N;
  insertail(2);
  insertail(3);
  insertbegin(4);
  insertpos(6,1);
   display();
   delhead();
   display();
   deltail();
   display();
   delpos(2);
   display();
   return 0;
}