Given a singly linked list and integer k . We have to reverse elements in the group of k a and the left out elements should be reversed as well

#include<iostream>
using namespace std;

class node{
public:
int data ;
node * n_adress ;


node (int data ){
    this->data = data ;
    n_adress = NULL ;
}

};

// creating a new class  , which is returning both head and tail....
class both{
public :
node * head ; 
node * tail ; 

};

node * take_input(){
    int data ;
    cin >> data ;
    node * fh = NULL ;
    node * ft = NULL ;
    while(data != -1){
        node * temp = new node(data) ;
        if(fh == NULL){
            fh = temp ;
            ft = temp ;
        }else{
            ft->n_adress = temp ;
            ft = temp ;
        }

        cin >> data ;
    }

    return fh ;
}
// reversing the LL....
both reversing (node * head ){
    if(head == NULL ||head->n_adress == NULL){
        both ans ;
        ans.head = head ;
        ans.tail = head ;
        return ans ; 
}
        both smallans = reversing(head->n_adress) ; 
        smallans.tail->n_adress = head ;
        head->n_adress = NULL ;
        smallans.tail = head ;
        return smallans ; 
    
}


node * k_reverse (node * head , int k ){
    if(head == NULL){
        return NULL ; 
    }
    int j = 1 ;
    node * h1 = head ;
    node * t1 = head ;
    while(j<k){
        if(t1->n_adress == NULL){
            break ; 
        }
        t1 = t1->n_adress ;
        j++ ; 
    }
    node * h2 = t1->n_adress ;
    t1->n_adress = NULL ;
    both smallans = reversing(h1) ;
    node * so = k_reverse(h2 , k) ;
    smallans.tail->n_adress = h2 ;
    return smallans.head ;

}

void print(node * head){
    node * temp = head ;
    while(temp != NULL){
        cout << temp->data << " " ;
        temp = temp->n_adress ; 
    
    }
    cout << endl; 
    return ;

}

int main(){

node * head = take_input() ;
print(head) ; 
int k ;
cin >> k  ;
node * f_ans = k_reverse(head , k ) ; 
print(f_ans) ;


}