![{
int arr[20];
node<T> *temp;
temp = front;
int i = 0, j;
while (temp != NULL)
{
arr[i] = temp->data;
temp = temp->next;
i++;
}
for (j = i - 1; j >= 0; j--)
{
cout << arr[j] << "<-";
}
}
Solution
#include <iostream>
#include "d_node.h"
#include "d_nodel.h"
#include "d_random.h"
using namespace std;
// return a pointer to the maximum element in the linked list
template <typename T>
node<T> *getMax(node<T> *front);](https://image.slidesharecdn.com/includeiostreamincludednode-220914224014-fc82c664/85/include-iostream-include-d_node-h-include-d_nodel-h-docx-4-320.jpg)
![int arr[20];
node<T> *temp;
temp = front;
int i = 0, j;
while (temp != NULL)
{
arr[i] = temp->data;
temp = temp->next;
i++;
}
for (j = i - 1; j >= 0; j--)
{
cout << arr[j] << "<-";
}
}](https://image.slidesharecdn.com/includeiostreamincludednode-220914224014-fc82c664/85/include-iostream-include-d_node-h-include-d_nodel-h-docx-9-320.jpg)
#include iostream#include d_node.h #include d_nodel.h.docx
- 1. #include <iostream> #include "d_node.h" #include "d_nodel.h" #include "d_random.h" using namespace std; // return a pointer to the maximum element in the linked list template <typename T> node<T> *getMax(node<T> *front); // if target is in the linked list, remove its first // occurrence; otherwise, do not modify the list template <typename T> void eraseValue(node<T> * & front, const T& target); // returns the sum of all elements in a single linked list template <typename T> int sum(node<T> *front); //// outputs the nodes of a single linked list in reverse order. template <typename T> void outputReverse(node<T> *front); int main() { node<int> *front = NULL, *p; randomNumber rnd; int listCount, i; cout << "Enter the size of the list: "; cin >> listCount; for (i = 0; i < listCount; i++) front = new node<int>(rnd.random(100), front); cout << "Original List of Values: "; writeLinkedList(front, " "); cout << endl; cout << "The Sum of all elements are: "; // <=============sum sld go here cout << sum(); cout << endl; //cout << "reverse is: "; // <============reverse should
- 2. go here outputReverse(); //cout << endl; cout << "Output in Descending Order: "; while (front != NULL) { p = getMax(front); cout << p->nodeValue << " "; eraseValue(front, p->nodeValue); } cout << endl; system("pause"); return 0; } template <typename T> node<T> *getMax(node<T> *front) { node<T> *curr = front, *maxPtr = front; while (curr != NULL) { if (maxPtr->nodeValue < curr->nodeValue) maxPtr = curr; curr = curr->next; } return maxPtr; } template <typename T> void eraseValue(node<T> * & front, const T& target) { // curr moves through list, trailed by prev node<T> *curr = front, *prev = NULL; // becomes true if we locate target bool foundItem = false; // scan until locate item or come to end of list while (curr != NULL && !foundItem) {
- 3. if (curr->nodeValue == target) // have a match { if (prev == NULL) // remove the first node front = front->next; else prev->next = curr->next; // erase intermediate node delete curr; foundItem = true; } else { // advance curr and prev prev = curr; curr = curr->next; } } } template <typename T> // <============================ need help calling to main int sum(node<T> *front) { int s = 0; node<T> *i; if (front == NULL) return 0; for (i = front; i != NULL; i = i->next) { s = s + i->data; } return s; } template <typename T> // <=============================== Need help calling to main void outputReverse(node<T> *front)
- 4. { int arr[20]; node<T> *temp; temp = front; int i = 0, j; while (temp != NULL) { arr[i] = temp->data; temp = temp->next; i++; } for (j = i - 1; j >= 0; j--) { cout << arr[j] << "<-"; } } Solution #include <iostream> #include "d_node.h" #include "d_nodel.h" #include "d_random.h" using namespace std; // return a pointer to the maximum element in the linked list template <typename T> node<T> *getMax(node<T> *front);
- 5. // if target is in the linked list, remove its first // occurrence; otherwise, do not modify the list template <typename T> void eraseValue(node<T> * & front, const T& target); // returns the sum of all elements in a single linked list template <typename T> int sum(node<T> *front); //// outputs the nodes of a single linked list in reverse order. template <typename T> void outputReverse(node<T> *front); int main() { node<int> *front = NULL, *p; randomNumber rnd; int listCount, i; cout << "Enter the size of the list: "; cin >> listCount; for (i = 0; i < listCount; i++) front = new node<int>(rnd.random(100), front); cout << "Original List of Values: "; writeLinkedList(front, " "); cout << endl; cout << "The Sum of all elements are: "; // <=============sum sld go here cout << sum();
- 6. cout << endl; //cout << "reverse is: "; // <============reverse should go here outputReverse(); //cout << endl; cout << "Output in Descending Order: "; while (front != NULL) { p = getMax(front); cout << p->nodeValue << " "; eraseValue(front, p->nodeValue); } cout << endl; system("pause"); return 0; } template <typename T> node<T> *getMax(node<T> *front) { node<T> *curr = front, *maxPtr = front; while (curr != NULL) { if (maxPtr->nodeValue < curr->nodeValue) maxPtr = curr; curr = curr->next;
- 7. } return maxPtr; } template <typename T> void eraseValue(node<T> * & front, const T& target) { // curr moves through list, trailed by prev node<T> *curr = front, *prev = NULL; // becomes true if we locate target bool foundItem = false; // scan until locate item or come to end of list while (curr != NULL && !foundItem) { if (curr->nodeValue == target) // have a match { if (prev == NULL) // remove the first node front = front->next; else prev->next = curr->next; // erase intermediate node delete curr; foundItem = true; } else { // advance curr and prev
- 8. prev = curr; curr = curr->next; } } } template <typename T> // <============================ need help calling to main int sum(node<T> *front) { int s = 0; node<T> *i; if (front == NULL) return 0; for (i = front; i != NULL; i = i->next) { s = s + i->data; } return s; } template <typename T> // <=============================== Need help calling to main void outputReverse(node<T> *front) {
- 9. int arr[20]; node<T> *temp; temp = front; int i = 0, j; while (temp != NULL) { arr[i] = temp->data; temp = temp->next; i++; } for (j = i - 1; j >= 0; j--) { cout << arr[j] << "<-"; } }