-
Notifications
You must be signed in to change notification settings - Fork 0
/
dequeOR.c
82 lines (69 loc) · 1.65 KB
/
dequeOR.c
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
//Deque is a type of queue which puts input and takes output from both side [front & rear]
//this is the code of Output Restricted Deque which gives permission to output from just one side. In this code we take the FRONT SIDE for output.
#include <stdio.h>
#include <stdlib.h>
struct node *head;
struct node{
int data;
struct node *next;
};
//display the values of linked-List
void display(struct node *flag){
int count = 0;
while(flag->next!=NULL){
printf("%d->", flag->data);
flag = flag->next;
count++;
}
printf("%d\n", flag->data);
printf("Total node is : %d.\n", count+1);
}
//adding elements in the first position.
void pushF(int val){
struct node *newN;
newN = malloc(sizeof(struct node));
newN->data = val;
newN->next = head;
head = newN;
}
//adding element in the last position
void pushB(int val){
struct node *newN, *flag;
flag = head;
newN = malloc(sizeof(struct node));
newN->data = val;
if(head == NULL){
newN->next = NULL;
head = newN;
return;
}
while(flag->next!=NULL){
flag = flag->next;
}
flag->next = newN;
newN->next = NULL;
}
//remove node from the first
void pool(){
struct node *flag;
flag = head;
head = head->next;
printf("%d has been removed.\n", flag->data);
free(flag);
}
int main(void){
head = NULL;
pushF(5);
pushF(4);
pushF(3);
pushF(2);
pushF(1);
pushB(6);
pushB(7);
pushB(8);
display(head);
pool();
pool();
display(head);
return 0;
}