Chapter 3, Problem 7R

Explanation of Solution

The algorithm to find the penultimate of the singly linked list:

Algorithm:

1. Find the length of linked list till the end.

2. Print the (len-1) n^th node of linked list from the beginning.

Explanation:

• The above algorithm is a simple algorithm to find the second last element of a singly linked list.
• In the algorithm there are two steps, the first one says that find the length of the linked list.
• The second step says that, print the elements up to n^th node of the linked list.

Psuedocode for finding 2nd last element:

Function : find2ndLast(head, data)

1. Create variable len=0 and create temp pointer and assign the value of head;

2. Count the number of node in linked list till temp is not equal to null

while(temp!=NULL)

temp= temp->next;

len ++

end while

3. Check if value of n is not more than length of the linked list

  if len less than data then return;

4...