You are currently viewing the BOOK: Professional C++ section of the Wrox Programmer to Programmer discussions. This is a community of tens of thousands of software programmers and website developers including Wrox book authors and readers. As a guest, you can read any forum posting. By joining today you can post your own programming questions, respond to other developers’ questions, and eliminate the ads that are displayed to guests. Registration is fast, simple and absolutely free .
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.