-
Notifications
You must be signed in to change notification settings - Fork 0
/
doublylinkedlist.c
65 lines (54 loc) · 1.25 KB
/
doublylinkedlist.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
#include <stdio.h>
#include <stdlib.h>
struct node
{
int data;
struct node *prev;
struct node *next;
/* data */
};
void traversalFront(struct node *ptr)
{
struct node *p = ptr;
while (p != NULL)
{
printf("%d->", p->data);
p = p->next;
}
printf("\n");
}
void traversalBack(struct node *ptr)
{
struct node *p = ptr;
struct node* d;
while (p != NULL)
{
p=p->next;
printf("%d->", p->data);
// p=p->prev;
}
printf("\n");
}
int main()
{
struct node *head = (struct node *)malloc(sizeof(struct node));
struct node *second = (struct node *)malloc(sizeof(struct node));
struct node *third = (struct node *)malloc(sizeof(struct node));
struct node *fourth = (struct node *)malloc(sizeof(struct node));
head->data = 4;
head->next = second;
head->prev = NULL;
second->data = 5;
second->next = third;
second->prev = head;
third->data = 6;
third->next = fourth;
third->prev = second;
fourth->data = 7;
fourth->next = NULL;
fourth->prev = third;
printf("Traveral Front\n");
traversalFront(head);
printf("Traveral back\n");
traversalBack(head);
}