title: Convert a queue to the stack?
body: <p>I have a queue with n elements in it and the front is at <code>0</code>. I need to create a stack of these numbers with <code>0</code> at the top.</p>
  
  <p>It can only be done with <em>EnQueue</em>, <em>DeQueue</em>, <em>Push</em>, and <em>Pop</em>, and constant storage. I dont need an answer so much as an idea of how I could approach this problem.</p>
  
  <p>Please don't answer this for me, but just try to understand I'm new at programming and could just use an idea of what is a way this can be done.</p>
  
  <ul>
  <li>Is it a Towers-of-Hanoi-like approach?</li>
  <li>Does that only use a constant storage?</li>
  </ul>
  
  <p>This isnt for homework, I just need some advice on how to proceed.  My first idea, reversing the queue and then pushing it did not work. I even tried sketching out other situations with no avail. Then I wondered if dequeueing and pushing them all, then popping and enqueueing them all, then dequeue and push again.</p>
  
  <ul>
  <li>Is this efficient?</li>
  <li>Does this use constant storage?</li>
  </ul>
  
  <p>I am still learning fundamental programming concepts. Please be nice! :)</p>