History, asked by san6177, 5 months ago

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

O(nlogn)

O(logn)

O(n)

O(n2)

Answers

Answered by nehadagarxd

1

Explanation:

since a singly linked list is used first you have to traverse till the end so the complexity is 0(n).8

Previous Question

Next Question

Similar questions

English, 2 months ago

format if formal and informal letter...

Social Sciences, 2 months ago

What Are The Effects Of Increased Population On Ecosystem ? . . . spamed answer allowed ...

Business Studies, 2 months ago

green plants said to be tropic level...

English, 5 months ago

سر - موارد زیر را در سرور سرور کے گھر والے مرد با رویکرد...

Math, 5 months ago

3/4-2/3 is equal to...

Math, 10 months ago

(ma+nb)+(na+mb)=? what is the answer of this question...

Math, 10 months ago

how do whales and dolphins communicate in water ...

Physics, 10 months ago

in which atmosphere layer does aeroplane fly...