Consider a singly Linked List of the form as given in the figure below. In which F is a pointer to the first element of LinkedList and L is the pointer to the last element of the LinkedList.
Which of the following operations time complexity depends upon the length of the Linked List?
1
Add an element after the last element of the LinkedList
2
Interchange the first two-element of the list
3
Add an element before the first element of the list
4
Delete the last element of the list
5
Question Not Attempted