I am trying to insert student records into a linked list ordered by student id. What is wrong with my insert function??? My insert function and results are shown below.

void LinkedList: :insertNode (student x)t ListNode *newNode; //a new node ListNode *nodePtr; ListNode *previousNode nullptr; //previous node newNode = new ListNode; newNode-)sName = x.getName(); newNode->sTestAvg = x.getTestavg(); newNode-25Address = x.getAddress(); newMode->sId = x.getId(); //if there are no nodes in the list make newNode first node if (lhead) { head = newNode; newNode->next nullptr; else nodePtr = head; previousNode = nullptr; while (nodePtr != nullptr && nodePtr-sld next ; if (previousNode == nullptr) { // if the new node is to be the first in list head = newNode; newNode->next nodePtr; ) else //insert after the previous node previousNode->next = newNode; newNode->next nodePtr; void LinkedList: :insertNode (student x)t ListNode *newNode; //a new node ListNode *nodePtr; ListNode *previousNode nullptr; //previous node newNode = new ListNode; newNode-)sName = x.getName(); newNode->sTestAvg = x.getTestavg(); newNode-25Address = x.getAddress(); newMode->sId = x.getId(); //if there are no nodes in the list make newNode first node if (lhead) { head = newNode; newNode->next nullptr; else nodePtr = head; previousNode = nullptr; while (nodePtr != nullptr && nodePtr-sld next ; if (previousNode == nullptr) { // if the new node is to be the first in list head = newNode; newNode->next nodePtr; ) else //insert after the previous node previousNode->next = newNode; newNode->next nodePtr