Sorting while inserting nodes in linked list

// Sorting while inserting nodes in linked list

#include <iostream>
using namespace std;

typedef struct List {
    int key;
    struct List *next;
} nodeType, *nodePtr;

nodePtr createList(nodePtr node) {
    cout << "\nHow many elements do wish to have in your list? Elements: ";
    int els; cin >> els; nodePtr curr = NULL;
    for (int i = 0; i < els; i++) {
        cout << "\nElement " << i + 1 << ": ";
        int item; cin >> item;
        nodePtr newNODE = new nodeType;
        newNODE->key = item; newNODE->next = NULL;
        if (node == NULL)
            node = newNODE;
        else if (node->key > item) {
            newNODE->next = node;
            node = newNODE;
        }
        else {
            curr = node;
            while (curr->next != NULL && curr->next->key < item)
                curr = curr->next;
            if (curr->next == NULL)
                curr->next = newNODE;
            else {
                newNODE->next = curr->next;
                curr->next = newNODE;
            }
        }
    }
    return node;
}

void dispList(nodePtr node) {
    cout << "\n\nThe list so far: ";
    while (node != NULL) {
        cout << node->key << " ";
        node = node->next;
    }
}

int main() {
    nodePtr start = NULL;
    start = createList(start);
    dispList(start);
    cout << "\n\n";
    return 0;
}