-
Notifications
You must be signed in to change notification settings - Fork 0
/
doubly_LL.c
118 lines (95 loc) · 2.07 KB
/
doubly_LL.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
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
#include <stdio.h>
#include <stdlib.h>
// Node structure for the doubly linked list
struct Node
{
int data;
struct Node *prev;
struct Node *next;
};
// Function to create a new node
struct Node *createNode(int data)
{
struct Node *newNode = (struct Node *)malloc(sizeof(struct Node));
newNode->data = data;
newNode->prev = NULL;
newNode->next = NULL;
return newNode;
}
struct Node *insertFront(struct Node *head, int data)
{
struct Node *newNode = createNode(data);
newNode->next = head;
if (head != NULL)
{
head->prev = newNode;
}
return newNode;
}
struct Node *insertBack(struct Node *head, int data)
{
struct Node *newNode = createNode(data);
struct Node *last = head;
if (head == NULL)
{
return newNode;
}
while (last->next != NULL)
{
last = last->next;
}
last->next = newNode;
newNode->prev = last;
return head;
}
struct Node *deleteNode(struct Node *head, int key)
{
struct Node *temp = head;
while (temp != NULL && temp->data != key)
{
temp = temp->next;
}
if (temp == NULL)
{
printf("Node not found\n");
return head; // Return the unchanged head if the node was not found
}
if (head == temp)
{
head = temp->next;
}
if (temp->next != NULL)
{
temp->next->prev = temp->prev;
}
if (temp->prev != NULL)
{
temp->prev->next = temp->next;
temp->prev=NULL;
}
free(temp);
return head; // Return the updated head
}
// Function to print the list in forward direction
void printForward(struct Node *node)
{
printf("List in forward direction: ");
while (node != NULL)
{
printf("%d ", node->data);
node = node->next;
}
printf("\n");
}
int main()
{
struct Node *head = NULL;
head = insertFront(head, 10);
head = insertFront(head, 20);
head = insertBack(head, 30);
head = insertBack(head, 40);
printForward(head);
deleteNode(head, 40);
printForward(head);
return 0;
}