708. Insert into a Sorted Circular Linked List

Given the head node of a sorted circular linked list (in ascending order), insert a new value insertVal into the list while maintaining its sorted order. The list is circular, meaning the last node points back to the first.

Examples
Input: [[3,4,1],2]
Output: [3,4,1,2]
Hints
Related Problems

708. Insert into a Sorted Circular Linked List

Given the head node of a sorted circular linked list (in ascending order), insert a new value `insertVal` into the list while maintaining its sorted order. The list is circular, meaning the last node points back to the first.