Node SortedInsert(Node head,int data) 
{
    Node temp = head;
    
    while (temp != null)
    {
        if (temp.next == null || temp.next.data >= data)
        {
            Node node = new Node();
            node.data = data;
            node.next = temp.next;
            node.prev = temp;

            if (temp.next != null)
            {
                temp.next.prev = node;
            }

            temp.next = node;

            break;
        }
        
        temp = temp.next;
    }
    
    return head;
}