void InsertAtEnd(int val) { if (checkempty()) { Node *nnode=new Node; nnode->data=val; nnode->next=head; head=nnode; } else { Node * curr; curr=head; Node *curr1; curr1=curr->next; while(curr1!=NULL) { curr=curr->next; curr1=curr1->next; } Node *nnode=new Node; nnode->data=val; curr->next=nnode;} }
void DeleteFirstNode() { if(checkempty()) { cout<<"Already empty"; } else { Node * curr; curr=head; head=head->next; delete curr; } }
void DeleteLastNode() { if(checkempty()) { cout<<"Already empty"; } else if (head->next==NULL) { Node * curr; curr=head; head=head->next; delete curr; } else { Node *curr; Node *curr1; curr=head; curr1=curr->next; while(curr1->next!=NULL) { curr=curr->next; curr1=curr1->next; } curr->next=NULL; delete curr1; } }