#include using namespace std; class Node{ public: float data; Node* next; }; //print linked list void printList(Node* n){ while(n!=NULL){ cout<data<<" "; n=n->next; } } //add new node at the front void push(Node** head_ref,float new_data){ Node* new_node = new Node(); new_node->data = new_data; new_node->next = (*head_ref); (*head_ref) = new_node; } //add new node after a given node void insertAfter(Node* prev_node,float new_data){ if(prev_node==NULL){//the given node is empty cout<<"the given previous node cannot be NULL"; return; } Node* new_node = new Node(); new_node->data = new_data; new_node->next = prev_node->next; prev_node->next = new_node; } //add new node at the end void append(Node** head_ref,float new_data){ Node* new_node = new Node(); new_node->data = new_data; new_node->next = NULL; Node *last = *head_ref; if(*head_ref == NULL){ *head_ref = new_node; return; } while(last->next != NULL){ last = last->next; } last->next = new_node; return; } //deletes the first occurrence of key void deleteNode(Node** head_ref, float key){ Node* temp = *head_ref,*prev; if(temp != NULL && temp->data == key){ *head_ref = temp->next; free(temp); return; } while(temp != NULL && temp->data != key){ prev = temp; temp = temp->next; } if(temp == NULL) return; prev->next = temp->next; free(temp); return; } //delete last node void delLastNode(Node* head_ref){ Node *last = head_ref,*prev; if(head_ref == NULL){ return; } while(last->next != NULL){ prev = last; last = last->next; } free(last); prev->next = NULL; return; } //print and delete last node void pop(Node* head_ref){ Node *last = head_ref,*prev; if(head_ref == NULL){ return; } while(last->next != NULL){ prev = last; last = last->next; } cout<data<next = NULL; return; } int main(){ Node* head = NULL; //add 1-10 to the linked list for(int i=1; i<=10;i++){ append(&head, i); } printList(head); cout<

Linked list