Split Circular Linked List into two halves in Java

class CircularLinkedListSplit {

    static class Node {
        int data;
        Node next;
        Node(int data) {
            this.data = data;
        }
    }

    Node head;

    // Function to split the circular linked list
    void splitList() {
        Node slow = head;
        Node fast = head;

        if (head == null || head.next == head) {
            return; // No split possible
        }

        // Use slow and fast pointers to find mid
        while (fast.next != head && fast.next.next != head) {
            slow = slow.next;
            fast = fast.next.next;
        }

        // For odd number of nodes, move fast one step more
        if (fast.next.next == head) {
            fast = fast.next;
        }

        // First half head
        Node head1 = head;

        // Second half head
        Node head2 = slow.next;

        // Make first half circular
        slow.next = head1;

        // Make second half circular
        fast.next = head2;

        // Print both lists
        System.out.println("First Circular Linked List:");
        printCircularList(head1);

        System.out.println("Second Circular Linked List:");
        printCircularList(head2);
    }

    // Function to print circular list
    void printCircularList(Node node) {
        Node temp = node;
        if (node != null) {
            do {
                System.out.print(temp.data + " ");
                temp = temp.next;
            } while (temp != node);
        }
        System.out.println();
    }

    // Function to add node at end
    void addNode(int data) {
        Node newNode = new Node(data);
        if (head == null) {
            head = newNode;
            newNode.next = head;
            return;
        }
        Node temp = head;
        while (temp.next != head) {
            temp = temp.next;
        }
        temp.next = newNode;
        newNode.next = head;
    }

    // Driver Code
    public static void main(String[] args) {
        CircularLinkedListSplit list = new CircularLinkedListSplit();

        list.addNode(10);
        list.addNode(20);
        list.addNode(30);
        list.addNode(40);
        list.addNode(50);

        System.out.println("Original Circular Linked List:");
        list.printCircularList(list.head);

        list.splitList();
    }
}