Remove Nth Node From End Of The Linked List

#include
using namespace std;

struct Node {
    int val;
    Node* next;

    Node(int value){
        val = value;
        next = NULL;
    }
};

void push_front(Node** head, int new_val){
    Node* new_node = new Node(new_val);
    new_node->next = *head;
    *head = new_node;
}

void printList(Node* head){
    Node* i = head;
    while(i){
        cout<val<<" ";
        i = i->next;
    }
    cout<<"\n";
}

void remove_nth_node_from_end(Node** head, int n){
    Node *i, *j;
    i = j = *head;

    n--;
    // move j n steps ahead
    while(n>0 && j->next!=NULL){
        j = j->next;
        n--;
    }

    if(n!=0){
        cout<<"n is either <= 0 or larger than the linked list size\n";
        return;
    }

    // move i and j together till j reaches the end
    Node *prev = i;
    while(j->next!=NULL){
        prev = i;
        i = i->next;
        j = j->next;
    }

    // now i will point to the nth node from end
    // remove it
    prev->next = i->next;

    // if i points to first node
    // modify the head pointer as well
    if(i == *head){
        *head = i->next;
    }
    delete i;
}


int main(){
    Node* head = NULL;

    push_front(&head, 5);
    push_front(&head, 4);
    push_front(&head, 3);
    push_front(&head, 2);
    push_front(&head, 1);

    printList(head);
    // 1 2 3 4 5
    
    // to remove 3rd node from end
    remove_nth_node_from_end(&head, 3);

    printList(head);
    // 1 2 4 5
}

class RemoveEnd 
{
	Node head;
	class Node 
    {
		int data;
		Node next;
		Node(int d)
		{
			data = d;
			next = null;
		}
	}
	// Function to delete the nth node from
	// the end of the given linked list
	void deleteNode(int key)
	{

		// First pointer will point to
		// the head of the linked list
		Node first = head;

		// Second pointer will point to the
		// Nth node from the beginning
		Node second = head;
		for (int i = 0; i < key; i++) {

			// If count of nodes in the given
			// linked list is <= N
			if (second.next == null) {

				// If count = N i.e. delete the head node
				if (i == key - 1)
					head = head.next;
				return;
			}
			second = second.next;
		}
		// Increment both the pointers by one until
		// second pointer reaches the end
		while (second.next != null) {
			first = first.next;
			second = second.next;
		}
		// First must be pointing to the
		// Nth node from the end by now
		// So, delete the node first is pointing to
		first.next = first.next.next;
	}
	public void push(int new_data)
	{
		Node new_node = new Node(new_data);
		new_node.next = head;
		head = new_node;
	}
	public void printList()
	{
		Node tnode = head;
		while (tnode != null) {
			System.out.print(tnode.data + " ");
			tnode = tnode.next;
		}
	}
	public static void main(String[] args)
	{
		RemoveEnd llist = new RemoveEnd();

		llist.push(7);
		llist.push(1);
		llist.push(3);
		llist.push(2);

		System.out.println("\nCreated Linked list is:");
		llist.printList();

		int N = 1;
		llist.deleteNode(N);

		System.out.println("\nLinked List after Deletion is:");
		llist.printList();
	}
}

class Node:

	def __init__(self, data):
		self.data = data 
		self.next = None 

class LinkedList:

	def __init__(self):
		self.head = None

	def create(self, x):

		new_node = Node(x)

		if self.head is None:
			self.head = new_node
			return

		last = self.head
		while last.next:
			last = last.next

		last.next = new_node

	def display(self):
		temp = self.head

		while temp:
			print(temp.data, end = " ")
			temp = temp.next

def removeNthFromEnd(head, k):
	
	first = head
	second = head
	count = 1
	while count <= k:
		second = second.next
		count += 1
	if second is None:
		head.value = head.next.value
		head.next = head.next.next
		return
	while second.next is not None:
		first = first.next
		second = second.next
	first.next = first.next.next


val = [1, 2, 3, 4, 5]
k = 3
ll = LinkedList()
for i in val:
	ll.create(i)

print("Linked list before modification:");
ll.display()

removeNthFromEnd(ll.head, k)

print("\nLinked list after modification:");
ll.display()