Linked lists

0. Under what circumstances can one delete an element from a singly linked list in constant time?

1. Given a singly linked list, determine whether it contains a loop or not.

2. Given a singly linked list, print out its contents in reverse order. Can you do it without using any extra space?

3. Reverse a singly linked list recursively. The function prototype is node * reverse (node *) ;

4. Given a singly linked list, find the middle of the list.