Register

#self doubt

268 views
0 votes
0 votes
1) How many stacks are needed to implement a queue .

2) How many queue are needed to implement a stack.
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

361
views
1 answers
0 votes
viral8702 asked Jul 22, 2023
361 views
Self Doubt
I have a doubt on simple Queue Implementation by an arrayAssume Queue is full(of n size),Front is pointing to first element and Rear is pointing to ... concept,I am just talking about simple queue implementation using array(Not circular).
User Avatar
1.3k
views
1 answers
0 votes
sushmita asked Sep 20, 2018
1,262 views
conceptual doubt
WHAT IS THE TIME COMPLEXITY TO ENQUEUE AN ELEMENT IF THE QUEUE IS IMPLEMENTED AS A CIRCULAR QUEUE AND WE HAVE GOT ONLY ONE POINTER TO FRONT ELEMENT??
User Avatar
1.2k
views
2 answers
1 votes
kapilbk1996 asked Jul 26, 2018
1,181 views
Self doubt
What are the minimum number of pointers required to implement a stack using single ended queue ( the queue is NOT a dequeue )?
User Avatar
511
views
1 answers
4 votes
GO Classes asked Feb 5
511 views
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 34
Suppose you implement a queue using a singly linked list with head and tail pointers so that the front of the queue is at the tail of the list, and the rear of the queue ... $O(1)$ for dequeue.$O(n)$ for both functions.
User Avatar
Link Copied!