Vidyalelo
Data Structure · Q99

Introduction to Data Structures

Programming · Data Structure · question 99

Q99

What is the time complexity of deleting from the rear end of the dequeue implemented with a singly linked list?

A.
O(nlogn)
B.
O(logn)
C.
O(n)
Answer
D.
O(n2)

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board