#include using namespace std; template class LinkedList { template struct Node { U value; Node* next; }; private: Node* head; Node* tail; Node* getNode(int n) { int i = 0; struct Node* node = this->head; while (inext; i++; }; return node; }; public: void push(T value) { if (tail == nullptr) { head = new Node; head->value = value; tail = head; } else { struct Node* node = new Node; node->value = value; tail->next = node; tail = node; }; }; T pop() { struct Node* node = head; T value = head->value; head = head->next; delete node; return value; }; T peek() { return head->value; }; T get(int n) { return getNode(n)->value; }; T remove(int n) { struct Node* node = getNode(n-1); struct Node* node_n = node->next; node->next = node_n->next; T value = node_n->value; delete node_n; return value; }; void print() { cout << "[ "; struct Node* node = head; cout << node->value; node = node->next; while (node != nullptr) { cout << ", " << node->value; node = node->next; }; cout << " ]" << endl; }; }; int main() { cout << "list 1" << endl << endl; LinkedList list1 = LinkedList(); list1.push(1); list1.push(3); list1.push(5); list1.push(10); list1.print(); list1.remove(2); list1.print(); cout << "popped out: " << list1.pop() << endl; list1.print(); cout << "peeking at head: " << list1.peek() << endl; list1.print(); cout << endl << "list 2" << endl << endl; LinkedList list2 = LinkedList(); list2.push("hello"); list2.push("there"); list2.push("general"); list2.push("Kenobi"); list2.print(); list2.remove(1); list2.print(); cout << "popped out: " << list2.pop() << endl; list2.print(); cout << "peeking at head: " << list2.peek() << endl; list2.print(); }

Simple Generic Linked List