Remove every Kth node of the Linked list

#include <bits/stdc++.h>
using namespace std;

struct Node {
    int data;
    struct Node* next;
};

Node* deleteKthNode(Node *head,int K)
{
  Node *curr = head, *prv = NULL;
  int index = 1;
  /* Edge case 
  If K = 1 means every node has to be deleted
    that is why we first delete every node and
    then return the empty Linked list as NULL. */
  if(K==1){
      delete head;
      return NULL;
  }
  while(curr!=NULL){
      /* If current node’s index is divisible 
         by K then, delete the current Node.*/
      if(index%K==0){
          Node* temp = curr;
          curr = curr->next;
          prv->next=curr;
          temp->next=NULL;
          delete temp;
      }else{
          prv = curr;
          curr = curr->next;
      }
      index++;
  }
  return head;
}


void push(struct Node** head_ref, int new_data)
{
    struct Node* new_node = new Node;
    new_node->data = new_data;
    new_node->next = (*head_ref);
    (*head_ref) = new_node;
}

int main()
{

    Node* head = NULL;
    push(&head, 19);
    push(&head, 6);
    push(&head, 15);
    push(&head, 11);
    push(&head, 3);
    push(&head, 23);
    push(&head, 1);
    cout<<"Original Linked List: "<<endl;
    for (Node* temp = head; temp != NULL; temp = temp->next)
        cout << temp->data << " ";
    cout<<endl;
    int K = 2;
    head = deleteKthNode(head,K);
    cout<<"Linked List after removing every Kth node of the original linked list: "<<endl;
    for (Node* temp = head; temp != NULL; temp = temp->next)
        cout << temp->data << " ";
 
    return 0;
}

class KNode
{
    static class Node
    {
	    int data;
	    Node next;
    }
    // To remove complete list (Needed for case when k is 1)
    static Node freeList(Node node)
    {
	    while (node != null)
	    {
		    Node next = node.next;
		    node = next;
	    }
	    return node;
    }
    // Deletes every k-th node and returns head of modified list.
    static Node deleteKthNode(Node head, int k)
    {
	    // If linked list is empty
	    if (head == null)
		    return null;

	    if (k == 1)
	    {
		    head = freeList(head);
		    return null;
	    }
        // Initialize ptr and prev before starting traversal.
	    Node ptr = head, prev = null;

	    // Traverse list and delete every k-th node
	    int count = 0;
	    while (ptr != null)
	    {
		    // increment Node count
		    count++;

		    // check if count is equal to k
		    // if yes, then delete current Node
		    if (k == count)
		    {
			    // put the next of current Node in
			    // the next of previous Node
			    prev.next = ptr.next;

			    // set count = 0 to reach further k-th Node
			    count = 0;
		    }
		    // update prev if count is not 0
		    if (count != 0)
			    prev = ptr;

		    ptr = prev.next;
	    }
	    return head;
    }
    static void displayList(Node head)
    {
	    Node temp = head;
	    while (temp != null)
	    {
		    System.out.print(temp.data + " ");
		    temp = temp.next;
	    }
    }
    static Node newNode(int x)
    {
	    Node temp = new Node();
	    temp.data = x;
	    temp.next = null;
	    return temp;
    }
    public static void main(String args[])
    {
	    /* Start with the empty list */
	    Node head = newNode(1);
	    head.next = newNode(2);
	    head.next.next = newNode(3);
	    head.next.next.next = newNode(4);
	    head.next.next.next.next = newNode(5);
	    head.next.next.next.next.next = newNode(6);

	    int k = 3;
	    head = deleteKthNode(head, k);

	    displayList(head);
    }
}

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

def freeList(node):
	while (node != None):
		next = node.next
		node = next
	return node

def deleteKthNode(head, k):
	
	if (head == None):
		return None

	if (k == 1):
		freeList(head)
		return None
	
	ptr = head
	prev = None
	count = 0
	while (ptr != None):
		
		count = count + 1

		if (k == count):
			prev.next = ptr.next
			count = 0

		if (count != 0):
			prev = ptr

		ptr = prev.next
	
	return head

def displayList(head):
	temp = head
	while (temp != None):
		print(temp.data, end = ' ')
		temp = temp.next
	
def newNode( x):
	temp = Node(x)
	temp.data = x
	temp.next = None
	return temp

if __name__=='__main__':
	
	head = newNode(1)
	head.next = newNode(23)
	head.next.next = newNode(3)
	head.next.next.next = newNode(11)
	head.next.next.next.next = newNode(15)
	head.next.next.next.next.next = newNode(6)
	head.next.next.next.next.next.next = newNode(9)

	k = 2
	head = deleteKthNode(head, k)

	displayList(head)