title: Implement queue using push & pop operation of stack
body: <p>While searching on the internet I found many answers for <strong>How to implement a queue using 2 stacks?</strong><br/>
  But How can I implement a queue using only push and pop operations of a stack. The <strong>push</strong> operation of stack can be used in a similar way as <strong>enqueue</strong> operation of a queue as both appends the data at the end. But the problem lies in implementing <strong>deque</strong> operation as queue works in a FIFO manner while stack in a LIFO manner.<br/>
  I know somewhere we will have to use recursion as in case of reversing a stack using only push and pop operations of stack.
  The pseudocode which I am writing for reversing the stack using <strong>push(),pop() &amp; isEmptyStack()</strong> functions of a stack is<br/></p>
  
  <pre><code>void reverseStack(Stack s){
  if(isEmptyStack(s))
  return
  
  temp=pop(s)
  reverseStack(s)
  push(s,temp)
  }
  </code></pre>