Reply To:

Consider a singly linked list of the form where F is a pointer to the first element in the linked list and L is the pointer to the last element in the list. The time of which of the following operations depends on the length of the list?
(A) Delete the last element of the list
(B) Delete the first element of the list
(C) Add an element after the last element of the list
(D) Interchange the first two elements of the list

Home Modern › Forums › ISRO ›

Consider a singly linked list of the form where F is a pointer to the first element in the linked list and L is the pointer to the last element in the list. The time of which of the following operations depends on the length of the list?
(A) Delete the last element of the list
(B) Delete the first element of the list
(C) Add an element after the last element of the list
(D) Interchange the first two elements of the list

› Reply To:

Consider a singly linked list of the form where F is a pointer to the first element in the linked list and L is the pointer to the last element in the list. The time of which of the following operations depends on the length of the list?
(A) Delete the last element of the list
(B) Delete the first element of the list
(C) Add an element after the last element of the list
(D) Interchange the first two elements of the list