29303132333435363738394041424344454647484950515253545556575859

// Node class to represent each node in the linked list
class Node {
    int data;    
    Node next;   

    // Constructor with data and next pointer
    Node(int data1, Node next1) {
        data = data1;
        next = next1;
    }

    // Constructor with only data
    Node(int data1) {
        data = data1;
        next = null;
    }
}

// Solution class to handle linked list operations
class Solution {
    // Function to insert a new node at the head
    public Node insertAtHead(Node head, int newData) {
        // Create a new node whose next points to current head
        Node newNode = new Node(newData, head);
        // Return the new node as the head
        return newNode;
    }

    // Function to print the linked list
    public void printList(Node head) {
        Node temp = head;
        while (temp != null) {
            System.out.print(temp.data + " ");
            temp = temp.next;
        }
        System.out.println();
    }
}

// Main class
public class Main {
    public static void main(String[] args) {
        Solution sol = new Solution();

        // Creating a sample linked list: 2 -> 3
        Node head = new Node(2);
        head.next = new Node(3);

        System.out.print("Original List: ");
        sol.printList(head);

        // Inserting new node at head
        head = sol.insertAtHead(head, 1);

        System.out.print("After Insertion at Head: ");
        sol.printList(head);
    }
}

1234567891011121314151617181920212223242526272829303132333435363738394041

# Node class to represent each node in the linked list
class Node:
    # Constructor with data and optional next pointer
    def __init__(self, data1, next1=None):
        self.data = data1
        self.next = next1

# Solution class to handle linked list operations
class Solution:
    # Function to insert a new node at the head
    def insertAtHead(self, head, newData):
        # Create a new node whose next points to current head
        newNode = Node(newData, head)
        # Return the new node as the head
        return newNode

    # Function to print the linked list
    def printList(self, head):
        temp = head
        while temp:
            print(temp.data, end=" ")
            temp = temp.next
        print()

# Driver code
if __name__ == "__main__":
    sol = Solution()

    # Creating a sample linked list: 2 -> 3
    head = Node(2)
    head.next = Node(3)

    print("Original List:", end=" ")
    sol.printList(head)

    # Inserting new node at head
    head = sol.insertAtHead(head, 1)

    print("After Insertion at Head:", end=" ")
    sol.printList(head)

1234567891