What are the time complexities of finding 8th element from beginning and 8th element from end in a singly linked list? Let n be the number of nodes in linked list, you may assume that n>8.
A. O(n) and O(n)
B. O(1) and O(1)
C. O(n) and O(1)
D. O(1) and O(n)
Answer:D
What are the time complexities of finding 8th element from beginning and 8th element from end in a singly linked list? Let n be the number of nodes in linked list, you may assume that n>8.
A. O(n) and O(n) B. O(1) and O(1) C. O(n) and O(1) D. O(1) and O(n)