CircularLL.java

public class CircularLL {
    private Node head ;
    private Node tail ;

    public CircularLL (){
        this.head = null ;
        this.tail = null  ;

    }

    public void Insert ( int val){
        Node node = new Node(val);
         if (head == null ){
            head = node  ;
            tail = node ;
            return ;
         }

        tail.next = node ;
        node.next = head ;
        tail = node ;
    }

    public void Display (){
        Node node = head;
        if  (head != null){
            do {
                System.out.printf(node.val  + " -> " );
                node = node.next ;
            }
            while (node != head);           
        }
        System.out.println("return to head ");
    }


     public void delete (int val){
        Node node = head  ;
        if (node == null){
            return ;

        }

        if (node.val == val){
            head = head.next ;
            tail.next = head ;
            return ;
        }

        do {
            Node  n = node.next;
            if (n.val == val ){
                node.next = n.next ;
                break ;
            }
            node = node.next ;    
        } while (node.next != head);
     }

    private class Node {
        int val ;
        Node next ;

        public Node (int val){
            this.val = val ;            
        }

    }


}