#include using namespace std; template class list { private: struct node { t data; struct node *next; }; node *head = NULL; public: void Display() { node *tmp = head; while(tmp != NULL) { cout<< tmp->data<< " "; tmp = tmp->next; } } void Append(t n) { node *ptr = new node; ptr->data = n; ptr->next = NULL; if(head == NULL) head = ptr; else { node *tmp = head; while(tmp->next != NULL) tmp = tmp->next; tmp->next = ptr; } } void Insertion(t n, int pos) { node *tmp = head; int currPos = 1; while(currPos < pos-1) { tmp = tmp->next; currPos++; } node *ptr = new node; ptr->data = n; ptr->next = tmp->next; tmp->next = ptr; } void Delete(t n) { node *tmp = head; if(head->data == n) { head = head->next; delete tmp; } else { node *prc = tmp; while(tmp != NULL && tmp->data != n) { prc = tmp; tmp = tmp->next; } if(tmp->data == n) { prc->next = tmp->next; delete tmp; } } } void Search(t n) { node *tmp = head; while(tmp->next != nullptr && tmp->data != n) tmp = tmp->next; if(tmp->data == n) cout<< n<< " was Found"<data = n; ptr->next = head; head = ptr; } void Add_Fin(t n) { node *ptr = new node; ptr->data = n; ptr->next = NULL; node *tmp = head; while(tmp->next != NULL) tmp = tmp->next; tmp->next = ptr; } }; int main() { list l; l.Append(1); l.Append(2); l.Append(3); l.Append(4); l.Display(); cout<

Linked List on c++