=====data Keyword 2=====
queue enqueuing operation

====Definition====
Enqueuing is the operation of putting something at the end of a queue There for adding something to the queue

====References====
List any sites, books, or sources utilized when researching information on this topic. (Remove any filler text).

  * Reference 1
  * Reference 2
  * Reference 3



=====data Keyword 2 Phase 2=====
Queue Dequeuing Operation

====Definition====
Removes and returns the object at the beginning of the Queue (Represents a first-in, first-out collection of objects). Often referred to as a head-tail linked list.

====References====

  * http://msdn.microsoft.com/en-us/library/system.collections.queue.dequeue(v=vs.71).aspx
  * http://en.wikipedia.org/wiki/Double-ended_queue
  * http://publib.boulder.ibm.com/infocenter/iseries/v5r4/index.jsp?topic=%2Frzajq%2Frzajqdequeue.htm
====Demonstration====
Demonstration of the indicated keyword.

If you wish to aid your definition with a code sample, you can do so by using a wiki **code** block, an example follows:

<code c>
/*
 * Sample code block
 */
#include <stdio.h>

List deque(List list1)
{
    //List is a stuct that contains the ending node's and starting node's address
    printf("%hhd", (list1 -> end));
    (list1 -> end) = (list1 -> end) -> next //could also be previous instead of end, depends on the coder's choice
    //You could also use start instead of end in this situation, both logically would, just reads different
    return(list1);
}
</code>