Register

self doubt

581 views

2 Answers

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

Related questions

1 votes
1 votes
2 answers
1
kapilbk1996 asked Jul 26, 2018
1,139 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 )?
What are the minimum number of pointers required to implement a stack using single ended queue ( the queue is NOT a dequeue )?
User Avatar
2 votes
2 votes
2 answers
2
Gurdeep Saini asked Jan 2, 2019
1,410 views
Stack implementation by using queue
true/false ? ) if stack is implemented as a array,all operation push ,pop ,is emptystack(),delete stack() can be performed in constant time. )if stack is implemented as a linked list ,all operation ,is emptystack(),delete stack() can be performed in constant time.
true/false ?) if stack is implemented as a array,all operation push ,pop ,is emptystack(),delete stack() can be performed in constant time.)if stack is implemented as a l...
User Avatar
1 votes
1 votes
1 answer
4
Ravi prakash pandey asked Apr 7, 2018
1,105 views
Stack and queue
Hi please verify me We can implement a stack using only one queue. Like first insert into queue and for popping a element from stack dequeue n-1 element from queue and enque into queue and then pop last element and do the same each time......try it and verify that I am right or wrong?
Hi please verify meWe can implement a stack using only one queue.Like first insert into queue and for popping a element from stack dequeue n-1 element from queue and enqu...
User Avatar
Link Copied!