In the deque implementation, using singly linked list, what would be the time…
BPSC TRE · TRE 2.0 · TGT (Classes 9–10) · Computer · 8 Dec 2023 · Single shift · Subject
In the deque implementation, using singly linked list, what would be the time complexity of deleting an element from the rear end?
- A.
O(1)
- B.
O(N log N)
- C.
O(N)
- D.
More than one of the above
- E.
None of the above
Attempted by 1306 students.
Sign up free to check your answer
Sign up freeLoading lesson…