-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtests.c
More file actions
185 lines (155 loc) · 6.56 KB
/
Copy pathtests.c
File metadata and controls
185 lines (155 loc) · 6.56 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
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
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
#include <stdio.h>
#include <stdlib.h>
#include "linked-list.h"
#include "unittest.h"
int main(void) {
// NULL
node *head = NULL;
TEST(list_length(head) == 0);
// 10 -> NULL
head = list_create_node(10);
TEST(head != NULL && head->data == 10 && head->next == NULL);
TEST(list_length(head) == 1);
// 10 -> 20 -> NULL
head->next = list_create_node(20);
TEST(head->next != NULL && head->next->data == 20 &&
head->next->next == NULL);
TEST(list_length(head) == 2);
// 30 -> 10 -> 20 -> NULL
list_insert_at_beginning(&head, 30);
TEST(head != NULL && head->data == 30 && head->next->data == 10 &&
head->next->next->data == 20 && head->next->next->next == NULL);
// 10 -> 20 -> NULL
list_remove_at_beginning(&head);
TEST(head != NULL && head->data == 10 && head->next->data == 20 &&
head->next->next == NULL);
// 10 -> 20 -> 40 -> NULL
list_insert_at_end(&head, 40);
TEST(head != NULL && head->data == 10 && head->next->data == 20 &&
head->next->next->data == 40 && head->next->next->next == NULL);
// 10 -> 20 -> NULL
list_remove_at_end(&head);
TEST(head != NULL && head->data == 10 && head->next->data == 20 &&
head->next->next == NULL);
// 33 -> NULL
node *one = list_create_node(33);
TEST(one != NULL && one->data == 33 && one->next == NULL);
list_remove_at_end(&one);
TEST(one == NULL);
free(one);
// 10 -> 20 -> NULL
node *search = list_search(head, 20);
TEST(search != NULL && search->data == 20);
TEST(list_search(head, 15) == NULL);
// 30 -> 10 -> 20 -> NULL
list_insert_at_beginning(&head, 30);
// 10 -> 20 -> 30 -> NULL
list_sort(&head);
TEST(head != NULL && head->data == 10 && head->next->data == 20 &&
head->next->next->data == 30 && head->next->next->next == NULL);
// 30 -> 20 -> 10 -> NULL
list_reverse(&head);
TEST(head != NULL && head->data == 30 && head->next->data == 20 &&
head->next->next->data == 10 && head->next->next->next == NULL);
// 30 -> 20 -> 10 -> NULL
TEST(list_get_at_index(head, -1) == -1)
TEST(list_get_at_index(head, 0) == 30)
TEST(list_get_at_index(head, 1) == 20)
TEST(list_get_at_index(head, 2) == 10)
TEST(list_get_at_index(head, 3) == -1);
// 30 -> 20 -> 10 -> NULL
TEST(list_insert_at_index(&head, -1, 40) == head)
// 50 -> 30 -> 20 -> 10 -> NULL
list_insert_at_index(&head, 0, 50);
TEST(head != NULL && head->data == 50 && head->next->data == 30 &&
head->next->next->data == 20 && head->next->next->next->data == 10 &&
head->next->next->next->next == NULL);
// 50 -> 30 -> 40 -> 20 -> 10 -> NULL
list_insert_at_index(&head, 2, 40);
TEST(head != NULL && head->data == 50 && head->next->data == 30 &&
head->next->next->data == 40 && head->next->next->next->data == 20 &&
head->next->next->next->next->data == 10 &&
head->next->next->next->next->next == NULL);
// 50 -> 30 -> 40 -> 20 -> 10 -> 60 -> NULL
list_insert_at_index(&head, 5, 60);
TEST(head != NULL && head->data == 50 && head->next->data == 30 &&
head->next->next->data == 40 && head->next->next->next->data == 20 &&
head->next->next->next->next->data == 10 &&
head->next->next->next->next->next->data == 60 &&
head->next->next->next->next->next->next == NULL);
// 50 -> 30 -> 40 -> 20 -> 10 -> 60 -> NULL
list_insert_at_index(&head, 10, 70);
TEST(head != NULL && head->data == 50 && head->next->data == 30 &&
head->next->next->data == 40 && head->next->next->next->data == 20 &&
head->next->next->next->next->data == 10 &&
head->next->next->next->next->next->data == 60 &&
head->next->next->next->next->next->next == NULL);
// 50 -> 30 -> 40 -> 20 -> 10 -> 60 -> NULL
list_remove_at_index(&head, -1);
TEST(head != NULL && head->data == 50 && head->next->data == 30 &&
head->next->next->data == 40 && head->next->next->next->data == 20 &&
head->next->next->next->next->data == 10 &&
head->next->next->next->next->next->data == 60 &&
head->next->next->next->next->next->next == NULL);
// 50 -> 30 -> 40 -> 20 -> 10 -> 60 -> NULL
list_remove_at_index(&head, 10);
TEST(head != NULL && head->data == 50 && head->next->data == 30 &&
head->next->next->data == 40 && head->next->next->next->data == 20 &&
head->next->next->next->next->data == 10 &&
head->next->next->next->next->next->data == 60 &&
head->next->next->next->next->next->next == NULL);
// 50 -> 30 -> 40 -> 20 -> 10 -> NULL
list_remove_at_index(&head, 5);
TEST(head != NULL && head->data == 50 && head->next->data == 30 &&
head->next->next->data == 40 && head->next->next->next->data == 20 &&
head->next->next->next->next->data == 10 &&
head->next->next->next->next->next == NULL);
// 50 -> 30 -> 20 -> 10 -> NULL
list_remove_at_index(&head, 2);
TEST(head != NULL && head->data == 50 && head->next->data == 30 &&
head->next->next->data == 20 && head->next->next->next->data == 10 &&
head->next->next->next->next == NULL);
// 30 -> 20 -> 10 -> NULL
list_remove_at_index(&head, 0);
TEST(head != NULL && head->data == 30 && head->next->data == 20 &&
head->next->next->data == 10 && head->next->next->next == NULL);
// 30 -> 20 -> NULL
// 10 -> NULL
node *init, *end;
list_split(head, &init, &end);
TEST(init != NULL && init->data == 30 && init->next->data == 20 &&
head->next->next == NULL);
TEST(end != NULL && end->data == 10 && end->next == NULL);
// 20 -> 30 -> NULL
// 10 -> NULL
// 10 -> 20 -> 30 -> NULL
list_sort(&init);
head = list_sorted_merge(init, end);
TEST(head != NULL && head->data == 10 && head->next->data == 20 &&
head->next->next->data == 30 && head->next->next->next == NULL);
// 30 -> 20 -> 10 -> NULL
list_reverse(&head);
TEST(head != NULL && head->data == 30 && head->next->data == 20 &&
head->next->next->data == 10 && head->next->next->next == NULL);
// 10 -> 20 -> 30 -> NULL
list_merge_sort(&head);
TEST(head != NULL && head->data == 10 && head->next->data == 20 &&
head->next->next->data == 30 && head->next->next->next == NULL);
// 10 -> 20 -> 30 -> NULL
TEST(list_has_cycle(head) == false);
// 10 -> 20 -> 30 -> 20 ...
head->next->next->next = head->next->next;
TEST(list_has_cycle(head) == true);
// 10 -> 20 -> 30 -> NULL
head->next->next->next = NULL;
TEST(list_has_cycle(head) == false);
// 10 -> 20 -> 30 -> NULL
TEST(list_is_palindrome(head) == false);
// 30 -> 20 -> 30 -> NULL
head->data = 30;
TEST(list_is_palindrome(head) == true);
// 30 -> 20 -> 30 -> NULL
list_traverse(head);
// empty
list_free(head);
}