-
Notifications
You must be signed in to change notification settings - Fork 0
/
Doubly reversed.c
70 lines (66 loc) · 1.02 KB
/
Doubly reversed.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
#include<stdio.h>
#include<stdlib.h>
struct node{
int data;
struct node *next;
struct node *prev;
}*n,*prev,*s,*head,*new,*temp,*head1,*head2,*curr,*next;
void print(struct node *head){
n=head;
printf("From front :\n");
while(n!=NULL){
printf("%d\n",n->data);
n=n->next;
}
n=head;
while(n->next!=NULL){
n=n->next;
}
printf("From tail :\n");
while(n!=NULL){
printf("%d\n",n->data);
n=n->prev;
}
}
void create(struct node **head){
n=(struct node *)malloc(sizeof(struct node));
scanf("%d",&n->data);
if (*head==NULL){
*head=n;
n->next=NULL;
n->prev=NULL;
prev=n;
}
else{
prev->next=n;
n->next=NULL;
n->prev=prev;
prev=n;
}
}
void rev(struct node **head){
prev=NULL;
curr=*head;
while(curr!=NULL){
next=curr->next;
curr->next=prev;
if(prev!=NULL)
prev->prev=curr;
prev=curr;
curr=next;
}
*head=prev;
(*head)->prev=NULL;
}
int main(){
int x;
printf("Enter data:\n");
scanf("%d",&x);
for(int i=0;i<x;i++)
create(&head);
printf("Data is:\n");
print(head);
rev(&head);
printf("Data is reversed:\n");
print(head);
}