Labsession Linked list problems-II
Assume the following node structure:
struct node {
int data;
struct node *next;
}
1. Given a linked list pointed by *A, write a function trim which deletes the first node.
In all linked list problems, always take care of the situation that the list may have only
one node or that the list may be empty.
struct node *trim(struct node *A)
2. Repeat problem 1 by writing the following function:
void trim(struct node * *A)
3. Given a linked list *B, write a function to add 10 to the last element.
struct node *add_last(struct node *B)
4. A linked list contains n nodes. Write a function which returns the data stored in the ith
node in response to the following call from the main program (0<i<=n)
value = content (pList, i );
int contents(struct node* list, int index)
{
int ii;
if (ii > 1) {
for( ii = 1; ii<index; ii++)
list = list->next;
}
return list->data;
}
5. Given a linked list *First, it is required to create a copy of the list and call it *Second.
The call from the main program would be
