Register

Queue Time Complexity

510 views
0 votes
0 votes
" Time Complexity of Dequeue will  be $ \leq $Time complexity of Enqueue  operations "

Justify the above statement
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

4 votes
4 votes
1 answer
1
Hemant Parihar asked Jan 20, 2018
1,539 views
Implementation of queue using stack
In implementation of queue using stack, deletion of second element from front take Ο(1) time, when insertion take Ο(n) time. Which of the following is correct ? True / False
In implementation of queue using stack, deletion of second element from front take Ο(1) time, when insertion take Ο(n) time.Which of the following is correct ?True / Fa...
User Avatar
Link Copied!