Generic_class_LinkedList_implementation.java

/*The code defines a generic singly linked list implementation using a class Generic_class_LinkedList_implementation<T> that supports any data type.
It includes an inner class Node that represents the nodes in the linked list, where each node stores a value (data) and a reference to the next node (next). */
public class Generic_class_LinkedList_implementation<T>{
    public class Node{
        T data;
        Node next;
    public Node(T data){
        this.data=data;
    }
}
    Node head;
    public Generic_class_LinkedList_implementation(T data){
        this.head=new Node(data);
    }
    public static void main(String args[]){
        Generic_class_LinkedList_implementation<Integer> obj=new Generic_class_LinkedList_implementation<>(10);
        obj.head.next=obj.new Node(20);
        while(obj.head!=null){
            System.out.print(obj.head.data+" ");
            obj.head=obj.head.next;
        }
        System.out.println();
        Generic_class_LinkedList_implementation<String> obj_string=new Generic_class_LinkedList_implementation<>("Anuj");
        obj_string.head.next=obj_string.new Node("Lovely");
        while(obj_string.head!=null){
            System.out.print(obj_string.head.data+" ");
            obj_string.head=obj_string.head.next;
        }
    }
}