In a doubly linked list, which operation takes O(1) time ?
2026
In a doubly linked list, which operation takes O(1) time ?
- A.
Searching for an element
- B.
Deleting a node when pointer to it is given
- C.
Finding the middle element
- D.
Reversing the list
Attempted by 223 students.
Show answer & explanation
Correct answer: B
In a doubly linked list, deleting a node given its pointer is O(1) time.