For this Question: Given a circular singly linked list containing N nodes, the task is to delete all the even nodes from the list.

Note:-The first digit of the list will always be an odd integer.

<b>Note:</b>Examples in Sample Input and Output just shows how a linked list will look like depending on the questions. Do not copy-paste as it is in <b>custom input</b><b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>deleteEven()</b> that takes head node of circular linked list as parameter.

Constraints:
1 <=N <= 1000
1 <= Node. data <= 1000Return the head of the modified listSample Input:-
4
1 2 3 4

Sample Output:-
1 3

Explanation:
1- >2- >3- >4- >1
After deletion of nodes
1- >3- >1

Sample Input:-
5
1 4 6 5 8

Sample Output:-
1 5

Explanation:
1- >4- >6- >5- >8->1
After deletion of nodes
1->5->1, I have written this Solution Code:   static Node deleteNode(Node head_ref, Node del)  
{  
    Node temp = head_ref;  
    // If node to be deleted is head node  
  
    if (head_ref == del)  
        head_ref = del.next;  
  
    // traverse list till not found  
    // delete node  
    while (temp.next != del) 
    {  
        temp = temp.next;  
    }  
  
    // copy address of node  
    temp.next = del.next;  
  
    return head_ref;  
}  
  
// Function to delete all even nodes  
// from the singly circular linked list  
static Node deleteEven(Node head)  
{  
    Node ptr = head;  
  
    Node next;  
  
    // traverse list till the end  
    // if the node is even then delete it  
    do 
    {  
        // if node is even  
        if (ptr.data % 2 == 0)  
            deleteNode(head, ptr);  
  
        // point to next node  
        next = ptr.next;  
        ptr = next;  
    }  
    while (ptr != head);  
    return head; 
}  

    
  , In this Programming Language: Java, Now tell me if this Code is compilable or not?