1

. Implement an algorithm to delete the

k

th element

from the tail

of a singly linked list. Your

algorithm should not use more than a few temporary storages and assume that it is not possible

to store or calculate the length of the linked list.

2.

Reverse

a given link list.

3. Given a singly linked list, find if there is a cycle in the linked list. (harder one: find the starting

point of the cycle if one exists)

4. Let s be a non

-

tail node in a singly linked list L, write a function that deletes s in O(1)

time.

struct node {

int data;

struct node* next;

};

int deleteNode (struct node* s) {