-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathInsert_Node_at_beginning_of_doubly_linked_list.c
More file actions
88 lines (81 loc) · 1.99 KB
/
Insert_Node_at_beginning_of_doubly_linked_list.c
File metadata and controls
88 lines (81 loc) · 1.99 KB
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
// Insert Node at Beginning of Doubly Linked List
#include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *next, *prev;
};
struct node *head = NULL, *temp = NULL, *newnode = NULL;
void create_linked_list();
void display_list();
void insert_node_at_beginning_of_linked_list();
int main()
{
create_linked_list();
display_list();
insert_node_at_beginning_of_linked_list();
display_list();
return 0;
}
void create_linked_list()
{
int choice = 1;
while (choice == 1)
{
newnode = (struct node *)malloc(sizeof(struct node));
if(newnode == NULL)
printf("Memory Not allocate.");
else
{
printf("Enter data of Node\n");
scanf("%d", &newnode->data);
newnode->prev = newnode->next = NULL;
if(head == NULL)
head = temp = newnode;
else
{
newnode->prev = temp;
temp->next = newnode;
temp = newnode;
}
printf("Do You want to add another node in Linked List? if yes press 1 else 0\n");
scanf("%d", &choice);
}
}
}
void display_list()
{
if(head == NULL)
printf("Linked List is Empty.");
else
{
temp = head;
printf("\nThe elements of Linked List are\n");
while(temp!=NULL)
{
printf("%d ", temp->data);
temp = temp->next;
}
}
}
void insert_node_at_beginning_of_linked_list()
{
if(head == NULL)
printf("Linked List is Empty.");
else
{
newnode = (struct node *)malloc(sizeof(struct node));
if (newnode == NULL)
printf("Memory Not allocate for creation of node.");
else
{
printf("\nEnter data of Newly Created Node\n");
scanf("%d", &newnode->data);
newnode->prev = NULL;
newnode->next = head;
head->prev = newnode;
head = newnode;
}
}
}