Baffling linked list error in C program

Question

I've been working at porting some programs over to a Mac that were built using MS C 6.0.  One of the programs uses a linked list to hold some data.  Just couldn't get it to work.  So I decided to run a really simple test.  Create a short linked list and then print out the list.
The code is below and the output is below that.  It looks like all the nodes get created properly and pointers assigned correctly but when I print out the list it crashes after the second node everytime.  It appears that in node 2 the link to the next node has been corrupted but I can't see anywhere that happens.  Is this not the way xcode does linked lists?
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
struct linklist {
    int node_number;
    char node_name[10];
    struct linklist * next;
struct linklist * makenode();
int main(int argc, const char * argv[])
    struct linklist * list_head;
    struct linklist * list_item;
    int i;
    // insert code here...
    printf("Hello, World!\n");
    list_head = makenode();
    list_head->node_number = 1;
    strcpy(list_head->node_name, "node 1");
    list_head->next = NULL;
    list_item = list_head;
    printf("head-> %0lx, item-> %0lx \n", (unsigned long) list_head, (unsigned long) list_item);
    for (i = 1; i < 10; i++)
        list_item->next = makenode();
        printf("New Node %d at %lu\n", i+1, (unsigned long) list_item->next);
        list_item = list_item->next;
        list_item->node_number = i+1;
        sprintf(list_item->node_name, "node %d", i+1);
        list_item->next = NULL;
        printf("list_item points at %lu\n", (unsigned long) list_item);
    list_item = list_head;
    for (i = 0; i < 10; i++)
        printf("list_item -> %lu>\n", (unsigned long) list_item);
        printf("%d - %s>\n", list_item->node_number, list_item->node_name);
        list_item = list_item->next;
    return 0;
struct linklist * makenode()
    return (struct linklist *) (malloc( sizeof(struct linklist())));
Output>>>>>
Hello, World!
head-> 7fdf604000e0, item-> 7fdf604000e0
New Node 2 at 140597369256496
list_item points at 140597369256496
New Node 3 at 140597369256512
list_item points at 140597369256512
New Node 4 at 140597369256528
list_item points at 140597369256528
New Node 5 at 140597369256544
list_item points at 140597369256544
New Node 6 at 140597369256560
list_item points at 140597369256560
New Node 7 at 140597369256576
list_item points at 140597369256576
New Node 8 at 140597369256592
list_item points at 140597369256592
New Node 9 at 140597369256608
list_item points at 140597369256608
New Node 10 at 140597369256624
list_item points at 140597369256624
list_item -> 140597369241824>
1 - node 1>
list_item -> 140597369256496>
2 - node 2>
list_item -> 7306087013738872835>

Answer 1

Change
return (struct linklist *) (malloc( sizeof(struct linklist())));
to
    return (struct linklist *) (malloc( sizeof(struct linklist)));
Hello, World!
head-> 100103b10, item-> 100103b10
New Node 2 at 4296031024
list_item points at 4296031024
New Node 3 at 4296031056
list_item points at 4296031056
New Node 4 at 4296031088
list_item points at 4296031088
New Node 5 at 4296031120
list_item points at 4296031120
New Node 6 at 4296031152
list_item points at 4296031152
New Node 7 at 4296031184
list_item points at 4296031184
New Node 8 at 4296031216
list_item points at 4296031216
New Node 9 at 4296031248
list_item points at 4296031248
New Node 10 at 4296031280
list_item points at 4296031280
list_item -> 4296030992>
1 - node 1>
list_item -> 4296031024>
2 - node 2>
list_item -> 4296031056>
3 - node 3>
list_item -> 4296031088>
4 - node 4>
list_item -> 4296031120>
5 - node 5>
list_item -> 4296031152>
6 - node 6>
list_item -> 4296031184>
7 - node 7>
list_item -> 4296031216>
8 - node 8>
list_item -> 4296031248>
9 - node 9>
list_item -> 4296031280>
10 - node 10>
Program ended with exit code: 0