danh sach lien ket

void printLast(Node* head, int k){
    int len = 0 ;
    for (auto p= head; p!=NULL;p=p->next ){
        len ++;
    }
    auto p = head;
    for (int i=0;i<len-k;i++){
        p=p->next;
    }
    while ( p!= nullptr){
        cout << p->value <<" ";
        p=p->next ;
    }
}