LC Insertion in Sorted Linked List

public class Solution {
  public ListNode insert(ListNode head, int value) {
    // Write your solution here
      if (head == null) {
         return new ListNode(value); 
    }
    if (head.value >= value) {
         ListNode newHead = new ListNode(value);
      newHead.next = head;
      return newHead;
    }
    ListNode cur = head;
    while (cur.next != null && cur.value <= value) {
      if (cur.next.value >= value) {
        ListNode node = new ListNode(value);
        node.next = cur.next;
        cur.next = node;
        break;
      }
         cur = cur.next; 
    }
    
    if (cur.next == null) {
         ListNode node = new ListNode(value);
         cur.next = node;
      node.next = null;
    }
    return head;
  }
}