public IEnumerator <T> GetEnumerator( )
{
LinkedNode <T> current = Head;
while (current != null)
{
yield return(current.Data);
current = current.Next;
}
}
public void addLast(LinkedNode <T> node)
{
if (Head == null)
{
Head = node;
}
else
{
node.Previous = Tail;
Tail.Next = node;
}
Tail = node;
count++;
}
public bool Contains(T item)
{
LinkedNode <T> current = Head;
while (current != null)
{
if (current.Data.Equals(item))
{
return(true);
}
current = current.Next;
}
return(false);
}
public void addFirst(LinkedNode <T> node)
{
if (Head == null)
{
Tail = node;
}
else
{
Head.Previous = node;
node.Next = Head;
}
Head = node;
count++;
}
