# Insert into a Cyclic Sorted List

Given a node from a cyclic linked list which is sorted in ascending order, write a function to insert a value into the list such that it remains a cyclic sorted list. The given node can be a reference to\_any\_single node in the list, and may not be necessarily the smallest value in the cyclic list.

If there are multiple suitable places for insertion, you may choose any place to insert the new value. After the insertion, the cyclic list should remain sorted.

If the list is empty (i.e., given node is`null`), you should create a new single cyclic list and return the reference to that single node. Otherwise, you should return the original given node.

The following example may help you understand the problem better:

![](https://leetcode.com/static/images/problemset/InsertCyclicBefore.png)

In the figure above, there is a cyclic sorted list of three elements. You are given a reference to the node with value 3, and we need to insert 2 into the list.

![](https://leetcode.com/static/images/problemset/InsertCyclicAfter.png)

The new node should insert between node 1 and node 3. After the insertion, the list should look like this, and we should still return node 3.

## Solution

```
/*
// Definition for a Node.
class Node {
    public int val;
    public Node next;

    public Node() {}

    public Node(int _val,Node _next) {
        val = _val;
        next = _next;
    }
};
*/
class Solution {
    public Node insert(Node node, int x) {  
        // write your code here  
        Node n = new Node(x);  
        if (node == null) {  
            n.next = n;  
            return n;  
        }  
        Node curr = node.next;  
        Node prev = node;  
        while (curr != node) {  
            if (prev.val <= x && curr.val >= x) {  
                break;  
            }  
            if (prev.val > curr.val && (prev.val < x || curr.val > x)) {  
                break;  
            }  
            curr = curr.next;  
            prev = prev.next;  
        }  
        prev.next = n;  
        n.next = curr;  
        return node;  
    }  
}
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://ondrej-kvasnovsky-2.gitbook.io/algorithms/interviews/google-leetcode/insert-into-a-cyclic-sorted-list.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.