title: Can a queue be implemented using only a hash-table?
body: <p>what i mean is that the implementation can only allocate a small (O(1)/O(log n)) amount of memory independently - most of the queue's data must be inside the hash table.</p>
  
  <p>EDIT: this data structure should support (Push,Pop,Top,Len) operations, but under the hood, instead of being a linked-list/array, it will use a hash-table. The majority O(n) memory needed will be contained in a hash-table.</p>