C++ problem #include #include using namespace std; class node { public: string data; node* next; }; //Print all items from first to end of list void printList(node* first) { } int main() { //Create a new node with data "Tiger" node* T; T = new node; (*T).data = "Tiger"; //Create a node with "Monkey" node* M; M = new node; (*M).data = "Monkeykey"; //Now, hook T's next field to point to M. (*T).next = M; //Let's create a "Whale" node node* W; W = new node; (*W).data = "Whale"; //Hook M's next to W (*M).next = W; //Let's create a "Dpg" node node* D; D = new node; (*D).data = "Dog"; //Let's hook W's next to D (*W).next = D; //Make next point of last item //point to nothing (null) (*D).next = nullptr; // Step 1: printList(T); //Print: Tiger Monkey Whale Dog // Step 2: create function that removes last item from list. removeLast(T); printList(T); //Tiger Monkey Whale removeLast(T); printList(T); //Tiger Monkey removeLast(T); printList(T); //Tiger // Step 3: write a function that adds an item to the back of the list addBack(T, "Fruits"); addBack(T, "Candy"); printList(T); //Tiger Fruits Candy addBack(T, "Duck"); addBack(T, "Elk"); printList(T); //Tiger Fruits Candy Duck Elk removeLast(T); removeLast(T); addBack(T, "Dove"); printList(T); //Tiger Fruits Candy Dove return 0; }

C++ problem

#include <iostream>

#include <string>

using namespace std;

class node

{

public:

string data;

node* next;

};

//Print all items from first to end of list

void printList(node* first)

{

}

int main()

{

//Create a new node with data "Tiger"

node* T;

T = new node;

(*T).data = "Tiger";

//Create a node with "Monkey"

node* M;

M = new node;

(*M).data = "Monkeykey";

//Now, hook T's next field to point to M.

(*T).next = M;

//Let's create a "Whale" node

node* W;

W = new node;

(*W).data = "Whale";

//Hook M's next to W

(*M).next = W;

//Let's create a "Dpg" node

node* D;

D = new node;

(*D).data = "Dog";

//Let's hook W's next to D

(*W).next = D;

//Make next point of last item

//point to nothing (null)

(*D).next = nullptr;

// Step 1:

printList(T); //Print: Tiger Monkey Whale Dog

// Step 2: create function that removes last item from list.

removeLast(T);

printList(T); //Tiger Monkey Whale

removeLast(T);

printList(T); //Tiger Monkey

removeLast(T);

printList(T); //Tiger

// Step 3: write a function that adds an item to the back of the list

addBack(T, "Fruits");

addBack(T, "Candy");

printList(T); //Tiger Fruits Candy

addBack(T, "Duck");

addBack(T, "Elk");

printList(T); //Tiger Fruits Candy Duck Elk

removeLast(T);

removeLast(T);

addBack(T, "Dove");

printList(T); //Tiger Fruits Candy Dove

return 0;

}