If the ADT queue had a method clearthat removed all entries from a queue, what would its definition be in the previous link-based implementation?

Question

What will be an ideal response?

Answer 1

A method clearcould repeatedly call dequeue until the queue is empty. One such definition follows:
```
template
void LinkedQueue::clear()
{
while (!isEmpty())
dequeue();
} // end clear

```
However, since dequeue is a boolean-valued method, you could replace the previous while loop with the following one:
```
while (dequeue())
{}

```