[Solved]Please Use C Pseudocode Correct Bottom Image Insertion Linked Listh File Code Needs Correc Q37111637

Please use the C++ pseudocodeto correct the bottom image. It is the insertion of a linked list.hfile, but the code needs correcting (gives C2760 Error). Pleasecomment if more information is needed.

head nullptr; void Insert(T data) dynamic new Node〈T>(data); in Node<T> *temp //Created new node a memory = //If the list is empty if (head nullptr) //Add it to the beginning and end of the list head – temp; else //Traverse to the end of the list Node〈T>* tempT head; while (tempT->nextnullptr) tempT tempT->next; //Attach the new node to the end of the 曰 tempT->next- temp; void Remove (T data) Linked List Ordered Pseudocode: method Insert(value <int> data) if (headNULL) 1. head = new Node(data, NULL) else Node ptr temp = head Node ptr tempT= NULL while(temp != NULL and temp.data < data): templ temp temp = temp.next if (temp NULL) tempT.next- new Node(data, NULL) else if (temp-head) tempT= new Node(data, head) head tempT else mpT.next = new Node(data, temp) te void Insert(T data) İf (head-= nullptr) //If the list is empty Node<T>(data, nullptr) head new else Node<T *temphead Node〈T> *tempT nullptr while (tempnullptr && temp->data < data): tempT = temp temp – temp->next if (temp == nullptr) Node<T>(data, nullptr) tempT->next new = else if (temp·head) tempT – new Node<T> (data, head) head – tempT else tempT->next – new Node<T> (data, temp) Show transcribed image text head nullptr; void Insert(T data) dynamic new Node〈T>(data); in Node *temp //Created new node a memory = //If the list is empty if (head nullptr) //Add it to the beginning and end of the list head – temp; else //Traverse to the end of the list Node〈T>* tempT head; while (tempT->nextnullptr) tempT tempT->next; //Attach the new node to the end of the 曰 tempT->next- temp; void Remove (T data)
Linked List Ordered Pseudocode: method Insert(value data) if (headNULL) 1. head = new Node(data, NULL) else Node ptr temp = head Node ptr tempT= NULL while(temp != NULL and temp.data data next if (temp == nullptr) Node(data, nullptr) tempT->next new = else if (temp·head) tempT – new Node (data, head) head – tempT else tempT->next – new Node (data, temp)

Expert Answer

---

Answer to Please use the C++ pseudocode to correct the bottom image. It is the insertion of a linked list.h file, but the code nee… . . .