Similarly , find the kth node from end and its previous . kth node from end is ( n - k + 1 ) th node from beginning
Node * y = * head_ref ; Node * y_prev = NULL ; for ( int i = 1 ; i < n - k + 1 ; i ++ ) { y_prev = y ; y = y -> next ; }