Your wording was confusing (at first glance) and an example would have helped, especially for a beginner. “baeten” gave an example (although it is not a unidirectional list), since I posted, and that combined with what you said should help them figure it out. If I was not so tired, I probably would have made it simpler (like ‘baeten”): It is trying to allocate the next node in a linked list, which is equivalent to adding a new link to a chain. The allocation may fail so make sure that malloc does not return NULL. node : A memory pointer to type ListEntry; that is the address of a memory block containing a ListEntry structure (a node). node->next : The next link in the chain; a pointer to the next structure (node). …. A linked list looks like this in memory node->next->next->next->NULL, where NULL is the end of the list (or chain). … Or something like that; I am not in the right frame of mind right now. You did a good job and they need to search for a tutorial and spend time playing with lists. Good night, or day (5 A.M. here).
INTP "Program testing can be used to show the presence of bugs, but never to show their absence."Edsger Dijkstra