-
Notifications
You must be signed in to change notification settings - Fork 5
/
linked_list.c
70 lines (57 loc) · 1.23 KB
/
linked_list.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
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct Node {
int number;
struct Node * next;
} NODE;
void addNode( NODE ** start, NODE * newNode )
{
if ( *start ) {
NODE * current = *start;
while ( current->next ) {
current = current->next;
}
current->next = newNode;
} else {
*start = newNode;
}
}
NODE * createNode( int number )
{
NODE * newNode;
newNode = malloc( sizeof( NODE ) );
newNode->next = NULL;
newNode->number = number;
return newNode;
}
int main( int argc, const char * argv[] )
{
NODE * start = NULL, * current;
char goOn;
int listSize = 0, number;
do {
printf( "La lista contiene %d nodos. Ingrese el siguiente numero (0 para finalizar): ", listSize );
scanf("%d", &number);
if ( number ) {
addNode( &start, createNode( number ) );
}
} while ( number );
current = start;
printf( "\nLa lista contiene los siguientes numeros: " );
while ( current ) {
printf( "%d", current->number );
printf( current->next ? ", " : "\n" );
current = current->next;
}
current = start;
NODE * next;
while ( current ) {
printf( "Liberando el nodo %d\n", current->number );
next = current->next;
free(current);
current = next;
}
printf("Todo liberado!\n");
return 0;
}