deQueue ( )

• bool IntQueue::deQueue(int & value)
• {
• if ( front == NULL ) return false;
• value = front->value;
• items --;
• Node * temp = front;
• front = front->next;
• delete temp;
• if(items == 0) rear = NULL;
• return true;
• }