First time here? Checkout the FAQ!
+4 votes

The queue data structure is to be realized by using stack. The number of stacks needed would be

  1. It cannot be implemented
  2. 2 stacks
  3. 4 stacks
  4. 1 stack
asked in DS by Veteran (79.1k points)   | 984 views

2 Answers

+3 votes
Best answer

The correct option is B.

answered by Active (2.3k points)  
selected by
@pankaj kumaras you have written if we want to perform queue operation then we need to pop ...but actually for queuing you don't need to pop you just need to push the elements in stack A like push a then push b push c this is for queuing but for dequeuing you must pop them from stack A and push them into B now for dequeuing pop then one by one to maintain the queue order.
you are right but the case is after insertion some element we want to remove an element from the queue and then again we want insertion that's why i did this.
it will work for all the cases.
+5 votes
answered by Veteran (47.9k points)  

Top Users Aug 2017

    4670 Points

  2. Bikram

    4556 Points

  3. akash.dinkar12

    3420 Points

  4. rahul sharma 5

    3124 Points

  5. manu00x

    2864 Points

  6. makhdoom ghaya

    2450 Points

  7. just_bhavana

    2136 Points

  8. Tesla!

    2042 Points

  9. stblue

    1930 Points

  10. joshi_nitish

    1686 Points

24,970 questions
32,072 answers
30,150 users