int n=this.size;
//int currnode=n-k+1;
Node curr=this.head;
Node prev=this.head;
int count=0;
for(int i=1;i<=n-k;i++) {
prev=curr;
curr=curr.next;
}
prev.next=null;
Node temp=curr;
while(temp.next!=null) {
temp=temp.next;
count++;
}
temp.next=this.head;