Chapter 17, Problem 16RQE

Program Plan Intro

List or Linked list:

Linked list is a linear and dynamic data structure which is used to organize data; it contains sequence of elements which are connected together in memory to form a chain. The every element of linked list is called as a node.

List head:

List head is a pointer used to point the first node in the linked list and it is also called as “head pointer”; if the “head pointer” points to a “NULL” value, then it is considered that the “list is empty”.

Graphical representation of linked list:

The graphical representation of a linked list is as follows:

cout statement:

“cout” stands for standard output stream.

• It is the c++ stream used to access the standard output, which in this case is the output screen.
• “cout” statement is followed by the “<<” operator which is called the insertion operator.
•  “<<” operator inserts the information that tails it into the stream and user can provide the required output.