Find the kth node from the beginning of the linked list . We also find previous of kth node because we need to update next pointer of the previous .
Node * x = * head_ref ; Node * x_prev = NULL ; for ( int i = 1 ; i < k ; i ++ ) { x_prev = x ; x = x -> next ; }