DataStructureInC/dlld.c at master · cdaman123/DataStructureInC · 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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
#include<stdio.h>
#include<stdlib.h>

typedef struct Node
{
    int data;
    struct Node * next;
    struct Node * prev;
}Node;

Node * head = NULL;

int length(){
    if(head == NULL){
        return 0;
    }else{
        int count = 0;
        Node * q = head;
        while(q!=NULL){
            count ++;
            q = q->next;
        }
        return count;
    }
}

void ins_start(){
    Node * P = (Node * )malloc(sizeof(Node));
    printf("Enter Data : ");
    int ele;
    scanf("%d",&ele);
    P->data = ele;
    P->next = NULL;
    P->prev = NULL;
    if(head == NULL)
        head = P;
    else{
        head->prev = P;
        P->next = head;
        head = P;
    }
}
void ins_any(int pos){
    int p = length();
    if(pos>=p){
        printf("Not Possible.\n");
    }else{
        Node * P = (Node * )malloc(sizeof(Node));
        printf("Enter Data : ");
        int ele;
        scanf("%d",&ele);
        P->data = ele;
        P->next = NULL;
        P->prev = NULL;
        Node * q = head;
        for(int i=0;i<pos-1;i++){
            q = q->next;
        }
        q->next->prev  = P;
        P->next = q->next;
        q->next = P;
        P->prev = q;
    }
}
void ins_end(){
    Node * P = (Node * )malloc(sizeof(Node));
    printf("Enter Data : ");
    int ele;
    scanf("%d",&ele);
    P->data = ele;
    P->next = NULL;
    P->prev = NULL;
    if(head == NULL)
        head = P;
    else{
        Node * q = head;
        while(q->next != NULL){
            q = q->next;
        }q->next = P;
        P->prev = q;
    }
}

void del_start(){
    if(head == NULL)
        printf("List is Empty\n");
    else{
        printf("Deleted ele is %d.\n",head->data);
        head->next->prev = NULL;
        head = head->next;
    }
}

void del_pos(int pos){
    if(head == NULL){
        printf("List is Empty");
    }else{
        int p = length();
        Node * q = head;
        if(pos>=p-1){
            printf("Not Possible!\n");
        }else{
            for(int i=0;i<pos-1;i++){
                q = q->next;
            }
            printf("Deleted ele is %d.\n",q->next->data);
            q->next->next->prev = q;
            q->next = q->next->next;
        }
    }
}

void del_end(){
    if(head == NULL){
        printf("List is empty.\n");
    }else{
        Node * q = head;
        while(q->next->next != NULL){
            q = q->next;
        }printf("Deleted ele is %d.\n",q->next->data);
        q->next = NULL;
    }

}
void display(){
    if(head == NULL){
        printf("List is empty.\n");
    }else{
        for(Node * q = head; q != NULL; q = q->next){
            printf("%d ->",q->data);
        }printf("\n");
    }
}


int main(){
    printf("1.Insert Start\n2.Ins at Pos\n3.Insert End\n4.Delet Start\n5.Delet at Pos\n6.Delet end\n7.Display\n8.Exit\n");
    while(1){
        printf("Enter Choice : ");
        int opt;
        scanf("%d",&opt);
        switch(opt){
            case 1:ins_start();break;
            case 2:printf("Enter Pos : ");int pos;scanf("%d",&pos);ins_any(pos);break;
            case 3:ins_end();break;
            case 4:del_start();break;
            case 5:printf("Enter Pos : ");int poss;scanf("%d",&poss);del_pos(poss);break;
            case 6:del_end();break;
            case 7:display();break;
            case 8:return 0;
        }
    }
}