public T Dequeue()
{
var data = Peek();
_first = _first.next;
Count--;
return(data);
}
public void Enqueue(T item)
{
MyQueueNode node = new MyQueueNode(item, null);
if (first == null)
{
first = node;
}
if (last != null)
{
last.Next = node;
}
last = node;
}
public T Dequeue()
{
if (first == null)
{
throw new Exception();
}
if (first == last)
{
last = null;
}
T item = first.Item;
first = first.Next;
return(item);
}
public void Enqueue(T item)
{
var node = new MyQueueNode(item);
if (IsEmpty)
{
_first = node;
_last = _first;
}
else
{
_last.next = node;
_last = node;
}
Count++;
}
public MyQueueNode(T item, MyQueueNode next)
{
Item = item;
Next = next;
}
