Chapter 17, Problem 9RQE

Explanation of Solution

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:

Function to print the value stored in the first node of a list:

//Definition of printing the first node function

void printFirst(ListNode *ptr)

{

/*Check the list w...