Description: Called deque (double-ended queue, deque), at both ends of the list can insert and delete data. Therefore, it allows the operating Create, IsEmpty, IsFull, Left, Right, AddLeft, AddRight, DeleteLeft, DeleteRight. Loop array deque, required to achieve the above-mentioned operation, and achieve a Print output operation, to be able to queue output by the left-to-right order of elements in a row, separated by spaces. Queue element type to integer.
To Search:
File list (Check if you may need any files):
zuoye3_1.cpp
Download