Insertion before the value X in LL

import java.util.*;

// Definition of singly linked list
class ListNode {
    int val;
    ListNode next;

    ListNode(int data1) {
        val = data1;
        next = null;
    }

    ListNode(int data1, ListNode next1) {
        val = data1;
        next = next1;
    }
}

// Solution class
class Solution {
    // Function to insert a new node before the given node
    public ListNode insertBeforeX(ListNode head, int X, int val) {
        if (head == null) {
            return null;
        }

        /* Insert at the beginning if the
        value matches the head's data */
        if (head.val == X)
            return new ListNode(val, head);

        ListNode temp = head;
        while (temp.next != null) {
            /* Insert at the current position if 
            the next node has the desired value */
            if (temp.next.val == X) {
                ListNode newNode = new ListNode(val, temp.next);
                temp.next = newNode;
                break;
            }
            temp = temp.next;
        }
        return head;
    }
}

// Main class
class Main {
    // Helper Function to print the linked list
    private static void printLL(ListNode head) {
        while (head != null) {
            System.out.print(head.val + " ");
            head = head.next;
        }
        System.out.println();
    }
    
    // main method
    public static void main(String[] args) {
        // Create a linked list from an array
        int[] arr = {1, 2, 4, 5};
        int X = 4, val = 3;
        ListNode head = new ListNode(arr[0]);
        head.next = new ListNode(arr[1]);
        head.next.next = new ListNode(arr[2]);

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

        // Create a Solution object
        Solution sol = new Solution();
        head = sol.insertBeforeX(head, X, val);

        // Print the modified linked list
        System.out.print("List after inserting a new node before the given node: ");
        printLL(head);
    }
}

# Definition of singly linked list
class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next

class Solution:
    # Function to insert a new node before the given node
    def insertBeforeX(self, head, X, val):
        if head is None:
            return None
        
        # Insert at the beginning if 
        # the value matches the head's data
        if head.val == X:
            return ListNode(val, head)
        
        temp = head
        while temp.next is not None:
            # Insert at the current position if 
            # the next node has the desired value
            if temp.next.val == X:
                newNode = ListNode(val, temp.next)
                temp.next = newNode
                break
            temp = temp.next
        
        return head

# Helper Function to print the linked list
def printLL(head):
    while head is not None:
        print(head.val, end=" ")
        head = head.next
    print()

if __name__ == "__main__":
    # Create a linked list from a list
    arr = [1, 2, 4, 5]
    X = 4
    val = 3
    head = ListNode(arr[0])
    head.next = ListNode(arr[1])
    head.next.next = ListNode(arr[2])

    # Print the original list
    print("Original List: ", end="")
    printLL(head)

    # Create a Solution object
    sol = Solution()
    head = sol.insertBeforeX(head, X, val)

    # Print the modified linked list
    print("List after inserting a new node before the given node: ", end="")
    printLL(head)

// Definition of singly linked list
class ListNode {
    constructor(val = 0, next = null) {
        this.val = val;
        this.next = next;
    }
}

// Solution class
class Solution {
    // Function to insert a new node before the given node
    insertBeforeX(head, X, val) {
        if (head === null) {
            return null;
        }

        /* Insert at the beginning if the
        value matches the head's data */
        if (head.val === X) {
            return new ListNode(val, head);
        }

        let temp = head;
        while (temp.next !== null) {
            /* Insert at the current position if the 
            next node has the desired value */
            if (temp.next.val === X) {
                let newNode = new ListNode(val, temp.next);
                temp.next = newNode;
                break;
            }
            temp = temp.next;
        }
        return head;
    }
}

// Helper Function to print the linked list
function printLL(head) {
    let current = head;
    while (current !== null) {
        process.stdout.write(current.val + " ");
        current = current.next;
    }
    console.log();
}

// Main function
let arr = [1, 2, 4, 5];
let X = 4, val = 3;
let head = new ListNode(arr[0]);
head.next = new ListNode(arr[1]);
head.next.next = new ListNode(arr[2]);

// Print the original list
console.log("Original List: ");
printLL(head);

// Create a Solution object
let sol = new Solution();
head = sol.insertBeforeX(head, X, val);

// Print the modified linked list
console.log("List after inserting a new node before the given node: ");
printLL(head);