Insertion of Single Link List at End

package DataS;

// Define the Node class
class Node {
    int data;
    Node next;

    // Constructor to initialize a new node with given data
    public Node(int data) {
        this.data = data;
        this.next = null;
    }
}

// Define the SingleLinkedList class
public class Single_Link_End {
    private Node head; // Head of the linked list

    // Constructor to initialize an empty linked list
    public Single_Link_End() {
        this.head = null;
    }

    // Method to insert a node at the end of the linked list
    public void insertAtEnd(int data) {
        Node newNode = new Node(data); // Create a new node with the given data
        
        // If the linked list is empty, make the new node as head
        if (head == null) {
            head = newNode;
            return;
        }
        
        // Traverse to the last node
        Node last = head;
        while (last.next != null) {
            last = last.next;
        }
        
        // Insert the new node at the end
        last.next = newNode;
    }

    // Method to print the linked list
    public void printList() {
        Node current = head; // Start from the head node
        System.out.print("Linked List: ");
        while (current != null) {
            System.out.print(current.data + " ");
            current = current.next;
        }
        System.out.println();
    }

    // Main method to test the implementation
    public static void main(String[] args) {
        Single_Link_End list = new Single_Link_End(); // Create an instance of Single_Link_End
        
        
        list.insertAtEnd(10);
        list.insertAtEnd(22);
        list.insertAtEnd(33);
        
        // Print the linked list
        list.printList();
    }
}