Exercise

1. What will be the time complexity when inserting a data element after an element that is being pointed to by a pointer in a linked list?
2. What will be the time complexity when ascertaining the length of the given linked list?
3. What will be the worst-case time complexity for searching a given element in a singly linked list of length n?
4. For a given linked list, assuming it has only one head pointer that points to the starting point of the list, what will be the time complexity for the following operations?
   1. Insertion at the front of the linked list
   2. Insertion at the end of the linked list
   3. Deletion of the front node of the linked list
   4. Deletion of the last node of the linked list
5. Find the n^th node from the end of a linked list.
6. How can you establish whether there is a loop (or circle) in a given linked list?
7. How can you ascertain the middle element of the linked list?

Join...