424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495
// Node class represents a node in a linked list
class Node {
    // Data stored in the node
    int data;
    // Pointer to the next node in the list
    Node next;

    // Constructor with both data and next node as parameters
    Node(int data1, Node next1) {
        data = data1;
        next = next1;
    }

    // Constructor with only data as a parameter, sets next to null
    Node(int data1) {
        data = data1;
        next = null;
    }
}

// Solution class containing the delete function
class Solution {
    // Function to delete the middle node of a linked list
    Node deleteMiddle(Node head) {
        // Initialize a temporary node to traverse the linked list
        Node temp = head;
        // Variable to hold the number of nodes in the linked list
        int n = 0;
        // Loop to count the number of nodes in the linked list
        while (temp != null) {
            n++;
            temp = temp.next;
        }
        // Calculate the index of the middle node
        int res = n / 2;
        // Reset the temporary node to the beginning of the linked list
        temp = head;
        // Loop to find the middle node to delete
        while (temp != null) {
            res--;
            // If the middle node is found
            if (res == 0) {
                // Create a pointer to the middle node
                Node middle = temp.next;
                // Adjust pointers to skip the middle node
                temp.next = temp.next.next;
                // Exit the loop after deleting the middle node
                break;
            }
            // Move to the next node in the linked list
            temp = temp.next;
        }
        // Return the head of the modified linked list
        return head;
    }
}

// Driver class
public class Main {
    // Function to print the linked list
    public static void printLL(Node head) {
        // Initialize a temporary pointer
        Node temp = head;
        // Traverse the linked list and print data
        while (temp != null) {
            System.out.print(temp.data + " ");
            temp = temp.next;
        }
        // Print a newline after the list
        System.out.println();
    }

    public static void main(String[] args) {
        // Creating a sample linked list
        Node head = new Node(1);
        head.next = new Node(2);
        head.next.next = new Node(3);
        head.next.next.next = new Node(4);
        head.next.next.next.next = new Node(5);

        // Display the original linked list
        System.out.print("Original Linked List: ");
        printLL(head);

        // Create a Solution object
        Solution obj = new Solution();
        // Deleting the middle node
        head = obj.deleteMiddle(head);

        // Displaying the updated linked list
        System.out.print("Updated Linked List: ");
        printLL(head);
    }
}
12345678910111213141516