Queue
How do you build a queue class which uses an integer data member 'count' that stores the number of elements currently in the queue to distinguish between a queue-full and a queue-empty condition instead of keeping an empty slot between the front and the back elements.
Thanks.
Didn't your professor explain this already, before he gave the assignment?
The crows maintain that a single crow could destroy the heavens. Doubtless this is so. But it proves nothing against the heavens, for the heavens signify simply: the impossibility of crows.
I think the real question here is...
How dont you build a queue class which uses an integer data member 'count' that stores the number of elements currently in the queue to distinguish between a queue-full and a queue-empty condition instead of keeping an empty slot between the front and the back elements.
