Welcome back
Code Integrity Verified.
linked_list.cpp
Scanning
1// linked_list.cpp · assignment 4
2
3// my linked list — handles insert + reverseStack Overflow · 99%
4struct Node { int data; Node* next; };
5class LinkedList {
6public:
7 Node* head = nullptr;
8 void insertAtEnd(int v) {
9 Node* n = new Node{v, nullptr};
10 if (!head) { head = n; return; }
11 Node* t = head;
12 while (t->next) t = t->next;
13 t->next = n;
14 }
14
15 void reverse() {GitHub · 94%
16 Node *prev = nullptr, *curr = head;
17 while (curr) {
18 Node* nx = curr->next;
19 bool hasCycle() {AI-Generated · 89%