doubly_linked_list.c
linked lists Implementation
86 lines1740 bytesC
1// Doubly Linked List
2#include <stdio.h>
3#include <stdlib.h>
4
5struct Node {
6 int data;
7 struct Node* prev;
8 struct Node* next;
9};
10
11// Insert at beginning
12struct Node* insertAtBeginning(struct Node* head, int data) {
13 struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
14 newNode->data = data;
15 newNode->prev = NULL;
16 newNode->next = head;
17
18 if (head != NULL) {
19 head->prev = newNode;
20 }
21
22 return newNode;
23}
24
25// Insert at end
26struct Node* insertAtEnd(struct Node* head, int data) {
27 struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
28 newNode->data = data;
29 newNode->next = NULL;
30
31 if (head == NULL) {
32 newNode->prev = NULL;
33 return newNode;
34 }
35
36 struct Node* temp = head;
37 while (temp->next != NULL) {
38 temp = temp->next;
39 }
40
41 temp->next = newNode;
42 newNode->prev = temp;
43 return head;
44}
45
46// Display forward
47void displayForward(struct Node* head) {
48 printf("Forward: ");
49 while (head != NULL) {
50 printf("%d <-> ", head->data);
51 head = head->next;
52 }
53 printf("NULL\n");
54}
55
56// Display backward
57void displayBackward(struct Node* head) {
58 if (head == NULL) return;
59
60 // Go to end
61 while (head->next != NULL) {
62 head = head->next;
63 }
64
65 printf("Backward: ");
66 while (head != NULL) {
67 printf("%d <-> ", head->data);
68 head = head->prev;
69 }
70 printf("NULL\n");
71}
72
73int main() {
74 struct Node* head = NULL;
75
76 head = insertAtEnd(head, 10);
77 head = insertAtEnd(head, 20);
78 head = insertAtEnd(head, 30);
79 head = insertAtBeginning(head, 5);
80
81 displayForward(head);
82 displayBackward(head);
83
84 return 0;
85}
86