linklist modifications

[bangura87]

i need to write more functions for the following code. for each function I need to incorporate it within the function and add some statements to the main function to test out my new function.

functions i need to incorporate in my code:

1.

int head_return(node_11**list); // returns the first integer from the head of the list, and deletes it from the list 

2.

int tail_return(node_11**list); // returns the last integer from the tail of the list, and deletes it from the list 

3.

bool ordered_list(node_11**list); // returns true if the list is in ascending order, and false otherwise  

4.

void print_11(node_11**list); // (which prints out the list in order from head to tail) using a for loop instead of a while loop 

#include<iostream>
using namespace std;

struct node_ll {
  int payload;
  node_ll *next;  // pointer to the next node
};

void head_insert(node_ll **list, int pload);
void tail_insert(node_ll **list, int pload);
void print_ll(node_ll **list);

int main() {
  node_ll *alist = NULL;	
  cout << "Empty list a to start\n";
  head_insert(&alist, 2);	
  head_insert(&alist, 4);
  head_insert(&alist, 6);
  cout << "List a after head insertion of 2,4,6 is \n";
  print_ll(&alist);
  cout << '\n';

  node_ll *blist = NULL;	
  cout << "Empty list b to start\n";
  tail_insert(&blist, 2);	
  tail_insert(&blist, 4);
  tail_insert(&blist, 6);
  cout << "List b after tail insertion of 2,4,6 is \n";
  print_ll(&blist);
  cout << '\n';
};

void head_insert(node_ll **list, int pload) {
  node_ll *temp = new node_ll;
  temp->payload = pload;
  temp->next = *list;
  *list = temp;
};

void tail_insert(node_ll **list, int pload) {
  node_ll *temp = new node_ll;
  if (*list == NULL) head_insert(list,pload);
  else {
    //set temp to last node
    for (temp = *list; temp->next; temp = temp->next);
    temp->next = new node_ll;
    temp->next->payload = pload;
    temp->next->next = NULL;
  };
};

void print_ll(node_ll **list) {
  node_ll *temp;
  temp = *list;
  while (temp) {
    cout << temp->payload << '\n';
    temp = temp->next;
  };
}

[jsmith]

What's the question?

[bangura87]

I dont know how to incorporate the fucntions I stated above into the code i posted, can you please shed some light?

[jsmith]

Add prototypes a la lines 10-12, then add the implementations at the end a la the other implementations.

Lastly write additional code in main() to call the new functions and output the values returned.