With regard to linked list, which of the following statement is false?
A. An algorithm to search for an element in a singly linked list requires 0(n) operations in the worst case.
B. An algorithm for deleting the first element in a singly linked list requires 0(n) operations in the worst case.
C. An algorithm for finding the maximum value in a circular linked list requires 0(n) operations.
D. An algorithm for deleting the middle node of a circular linked list requires 0(n) operations.
Answer:B
With regard to linked list, which of the following statement is false?
A. An algorithm to search for an element in a singly linked list requires 0(n) operations in the worst case. B. An algorithm for deleting the first element in a singly linked list requires 0(n) operations in the worst case. C. An algorithm for finding the maximum value in a circular linked list requires 0(n) operations. D. An algorithm for deleting the middle node of a circular linked list requires 0(n) operations.