void insert_order (int val) { if(checkempty()) { InsertAtStart(val); return; } Node *new_node; new_node= new Node; new_node->data=val; Node *prev, *cur; prev=NULL; cur=head; if(val<head->data) { new_node->next=head; head=new_node; cout<<"\tNumber Inserted: "<<val<<endl; return; } else {while(cur!=NULL && val>cur->data) { prev=cur; cur=cur->next; } new_node->next=cur; prev->next=new_node; } }
void delete_order(int val) { Node *cur; cur=head; if (checkempty()) { cout<<"Already empty"<<endl; } else if(head->data==val) { head=head->next; delete cur; cur=NULL; return; } else {while(cur->next!=NULL) { if(cur->next->data==val) { Node *d; d=cur->next; cur->next=cur->next->next; cout<<"\tNumber Deleted: "<<val<<endl; delete d; return; } cur=cur->next; } } cout<<" Number not found in the LIST\n"; }