Storage structure with two sequential stack, two stack through which the relevant operations to achieve the following functions queue. Queue () // constructor bool empty () // Returns whether the queue is empty bool full () // returned to the queue is full int serve () // the queue, return 0 if successful, otherwise-1 int append (const string & item) // item into the queue, return 0 if successful, otherwise returns-1 int retrieve (string & item) const // assign the value of the head of the queue item, return 0 if successful, otherwise-1

Ex2.cpp

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．