Insertion Sort List

public class Solution {
    public ListNode insertionSortList(ListNode head) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        ListNode prehead = new ListNode(0);
        ListNode runner = head;
        while(runner != null){
            ListNode tmp = runner.next;
            insertNode(prehead, runner);
            runner = tmp;
        }
        return prehead.next;
    }
    
    private void insertNode(ListNode head, ListNode node){
        ListNode runner = head.next;
        while(runner!=null){
            if(runner.val >= node.val)
                break;
            runner = runner.next;
            head = head.next;
        }
        head.next = node;
        node.next = runner;
    }
}