There are several data structures that allow you to dynamically add items without knowing in advance what the maximum number of items is required. There are linked lists, binary search trees, balanced trees, attempts, heaps, and more.
.
, , :
typedef struct _node {
struct _node *next;
char *value;
} node_t;
, , node . , , - :
currentNode = head;
while(currentNode != NULL) {
currentNode = currentNode->next;
}
, , , .
? , , ?