Description: (A) Title: Suppose to take the lead in the cycle of nodes that the queue list, and only set a pointer to the tail element node instead of being the head pointer and try to prepare the corresponding queue is initialized into the queue, the queue and determine the queue state algorithm. Complete the following using the above method of the operation and after operation in each output queue status. 1) The following elements one by one into the team: 5,7,3,8,55 Status: 5 elements 2) three elements of the Team Status: 2 element 3) and then two elements of the Team Status: Team Air 4) and then 1 elements out of Team Status: Team space (under the direction of overflow)
To Search:
File list (Check if you may need any files):
queue.cpp