问让mergesort在链表上工作？

EN

base operand of `->' has non-pointer type `LIST'

request for member `element' in `conductor', which is of non-aggregate type `LIST *'

#include <cstdlib>
#include <iostream>
#include <math.h>
#include <sys/time.h>

using namespace std;

typedef struct LIST {
    int element;
    LIST *next;
};

LIST split(LIST list)
{
    LIST pSecondCell;

    if (list == NULL)
        return NULL;
    else if (list.next == NULL)
        return NULL;
    else {
        pSecondCell = list.next;
        list.next = pSecondCell.next;
        pSecondCell.next = split(pSecondCell->next);
        return pSecondCell;
    }
}

LIST merge(LIST list1, LIST list2)
{
    if (list1 == NULL)
        return list2;
    else if (list2 == NULL)
        return list1;
    else if (list1.element <= list2.element) {
        list1.next = merge(list1.next, list2);
        return list1;
    } else {
        list2.next = merge(list1, list2.next);
    }
}

LIST MergeSort(LIST list)
{
    LIST SecondList;

    if (list == NULL)
        return NULL;
    else if (list.next == NULL)
        return list;
    else {
        SecondList = split(list);
        return merge(MergeSort(list), MergeSort(SecondList));
    }
}

int main(int argCount, char *argVal[])
{
    int i, number, max;
    struct timeval time1;
    struct timeval time2;

    //check for correct number of arguments
    if (argCount != 3) {
        cout << "Incorrect number of arguments" << endl;
        return 0;
    }
    // initialize read in n and max values
    number = atoi(argVal[1]);
    max = atoi(argVal[2]);

    // create list and fill with random numbers
    LIST *conductor;
    LIST *root = new LIST;
    conductor = root;

    for (i = 0; i < number; i++) {
        conductor.element = rand() % max;
        conductor.next = new LIST;
        conductor = conductor.next;
    }

    // time how long it takes to sort array using mergeSort
    gettimeofday(&time1, NULL);
    mergeSort(root);
    gettimeofday(&time2, NULL);

    // print name, sorted array, and running time
    cout << "Heather Wilson" << endl;

    conductor = root;

    for (i = 0; i < number - 2; i++) {
        cout << conductor.element << ", ";
        conductor = conductor.next;
    }

    double micro1 = time1.tv_sec * 1000000 + time1.tv_usec;
    double micro2 = time2.tv_sec * 1000000 + time2.tv_usec;

    cout << conductor.element << endl;
    cout << "Running time: " << micro2 - micro1 << " microseconds" << endl;

    return 0;
}