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; }
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
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;
}
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
