What are the time complexities of finding 8th element from beginning and 8th…
2024
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(1) and O(n)
- B.
O(1) and O(1)
- C.
O(n) and O(1)
- D.
O(n) and O(n)
Attempted by 326 students.
Show answer & explanation
Correct answer: A
Explanation:
Finding 8th element from beginning requires 8 nodes to be traversed which takes constant time. Finding 8th from end requires the complete list to be traversed.