my code
#include
using namespace std;
class node{
public:
int data;
node* next;
node(int val)
{
data=val;
next=NULL;
}
};
void insert(node*&head,int x){
if(head==NULL){
head=new node(x);
return;
}
node* cur=head;
while(cur->next!=NULL){
cur=cur->next;
}
cur->next=new node(x);
return;
}
void buildlist(node &head,int n){
int data;
cin>>data;
while(n>0){
cin>>data;
insert(head,data);
n–;
}
}
void print(node head){
node* temp=head;
while(temp->next!=NULL){
cout<data<<" ";
temp=temp->next;
}
}
node* append(node* head,int n,int k){
node* curr=head;
node* prev=head;
for(int i=0;i=(n-k);i++){
prev=curr;
curr=curr->next;
}
prev->next=NULL;
node* temp=curr;
while(temp->next !=NULL){
temp=temp->next;
}
temp->next=head;
return curr;
}
int main() {
int n;
cin>>n;
node* head=NULL;
buildlist(head,n);
int k;
cin>>k;
head=append(head,n,k);
print(head);
return 0;
}
