You are currently viewing the BOOK: Professional C++ section of the Wrox Programmer to Programmer discussions. This is a community of software programmers and website developers including Wrox book authors and readers. New member registration was closed in 2019. New posts were shut off and the site was archived into this static format as of October 1, 2020. If you require technical support for a Wrox book please contact http://hub.wiley.com
in circular queue, is there an instance that rear(q) = front(Q). what is rear(Q) if front(Q) = null? , what happens to queue if rear(Q) < front(Q)? will anybody give me an idea how these scenario will occur. thanks a lot.
Circular queue
