How to implement a multithreaded linked list insertion function? (Algorithms wil

Question

How to implement a multithreaded linked list insertion function? (Algorithms will help and if you don't know you don't need to answer please) How to implement a multithreaded linked list insertion function? (Algorithms will help and if you don't know you don't need to answer please)

Explanation / Answer

#include #include #include using namespace std; struct Node { int data; Node* next; }; Node* head; void Print() { cout next != NULL) { temp = temp -> next; cout next; temp1 -> next = temp2 -> next; delete temp2; } void Insert(int x, int n) { Node* temp = new Node(); temp -> data = x; temp -> next = NULL; if ( n == 1 ) { temp -> next = head; head = temp; return; } Node* temp1 = head; for (int i = 0; i next; } temp -> next = temp1 -> next; temp1 -> next = temp; } int main() { head = NULL; Insert(2,1); Insert(3,1); Insert(99,3); Insert(4,2); Insert(5,3); // 3, 4, 5, 99, 2 Print(); // 1st call Delete(2); Delete(3); // 3,5,2 Print(); // 2nd call return 0; }

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.