-
Notifications
You must be signed in to change notification settings - Fork 0
/
LinkedList.c
46 lines (39 loc) · 861 Bytes
/
LinkedList.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
#include <stdio.h>
#include <stdlib.h>
struct node
{
int data;
struct node* next;
};
void push(struct node** head_ref, int new_data){
struct node* new_node = (struct node*) malloc(sizeof(struct node));
new_node->data = new_data;
new_node->next=(*head_ref);
(*head_ref) = new_node;
}
void deleteNode(struct node **head_ref,int key){
struct node* temp = *head_ref, *prev;
//if head node is to be deleted
if(temp!=NULL && temp->data == key){
*head_ref = temp->next;
free(temp);
return;
}
while(temp!=NULL && temp->data != key){
prev = temp;
temp = temp->next;
}
if(temp == NULL) return;
prev->next = temp->next;
free(temp);
}
void printList(struct node *node){
while (node != NULL){
printf("%d", node->data);
node = node->next;
}
}
int main(){
struct node* head = NULL;
//call push and delete functions the way you want.
}