-
Notifications
You must be signed in to change notification settings - Fork 0
/
linkedList.c
112 lines (85 loc) · 2.18 KB
/
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
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
/*
* linkedList.c
*
*/
#include <stdio.h>
#include <stdlib.h>
#include "commonDefs.h"
#include "linkedList.h"
#include "memoryUtil.h"
linkedList_t* createList()
{
linkedList_t *pNewList = (linkedList_t*) safeMalloc(sizeof(linkedList_t));
pNewList->size = 0;
pNewList->pHead = NULL;
return pNewList;
} /* end of createList() */
void destroyList(linkedList_t *pList)
{
llNode_t *pCurrNode = pList->pHead;
while (pCurrNode != NULL) {
llNode_t *pTempNode = pCurrNode->pNext;
safeFree(pCurrNode, sizeof(llNode_t));
pCurrNode = NULL;
pCurrNode = pTempNode;
}
pList->pHead = NULL;
pList->size = 0;
safeFree(pList, sizeof(linkedList_t));
} /* end of destroyList() */
void addNode(linkedList_t *pList, int element)
{
llNode_t *pNewNode = (llNode_t*) safeMalloc(sizeof(llNode_t));
pNewNode->element = element;
/* if null, then first node. If not null, then pNewNode becomes new head. */
pNewNode->pNext = pList->pHead;
pList->pHead = pNewNode;
pList->size += 1;
} /** end of addNode() */
int deleteNode(linkedList_t *pList, int element)
{
llNode_t *pCurrNode = pList->pHead, *pPrevNode = NULL;
if (pCurrNode != NULL) {
/** If head is the deleted node. */
if (pCurrNode->element == element) {
pList->pHead = pCurrNode->pNext;
safeFree(pCurrNode, sizeof(llNode_t));
pList->size -= 1;
return SUCCESS;
}
pPrevNode = pCurrNode;
pCurrNode = pCurrNode->pNext;
}
while (pCurrNode != NULL) {
if (pCurrNode->element == element) {
pPrevNode->pNext = pCurrNode->pNext;
safeFree(pCurrNode, sizeof(llNode_t));
return SUCCESS;
}
pPrevNode = pCurrNode;
pCurrNode = pCurrNode->pNext;
}
/* Can't find element. */
return FAILED;
} /* end of deleteNode() */
int findElement(linkedList_t *pList, int element)
{
llNode_t *pCurrNode = pList->pHead;
while (pCurrNode != NULL) {
if (pCurrNode->element == element) {
return FOUND;
}
pCurrNode = pCurrNode->pNext;
}
/** Can't find element. */
return NOT_FOUND;
} /** end of findNode() */
void printList(linkedList_t *pList)
{
llNode_t *pCurrNode = pList->pHead;
while (pCurrNode != NULL) {
printf("%d ", pCurrNode->element);
pCurrNode = pCurrNode->pNext;
}
printf("\n");
} /* end of printList() */