// removeEveryKthNode

//

// this function will remove every kth element in the original queue

//

// your function should start at the BACK of the queue and work toward the front.

// here are some conceptual examples ( they also mirror what your linked lists will look like)

// the back is on the left and the front is on the right.

// Example 1. A B C D E F G H I J, k = 2

// Result: original queue is now: A C E G I

// Example 2. A B C D E F G H I J, k = 3

// Result: original queue is now: A B D E G H J

//

// Your solution must work directly on the underlying linked structure

// You may not use any other containers or Java classes to solve the problem

// precondition: k >= 1

public void removeEveryKthNode(int k) {