simple c++ clean solution
class Solution {\npublic:\n\n    ListNode insertionSortList(ListNode head) {\n        ListNode nxt = head -> next;\n        while(nxt != NULL)\n        {\n     
class Solution {\npublic:\n\n    ListNode* insertionSortList(ListNode* head) {\n        ListNode *nxt = head -> next;\n        while(nxt != NULL)\n        {\n            ListNode *curr = head;\n            while(curr != nxt)\n            {\n                if(nxt -> val < curr -> val)\n                    swap(curr -> val, nxt -> val);\n                \n                curr = curr -> next;\n            }\n            nxt = nxt -> next;   \n        }\n        return head;\n    }\n};
['Linked List', 'C']