//delete a element
public bool DeleteElement(T element)
{
var currentElement = Head;
LinkedListElementNode <T> previousElement = null;
//iterates through all elements
while (currentElement != null)
{
//checks if the element, which should get deleted is in this list element
if (currentElement.Data.Equals(element))
{
//if element is head just take the next one as head
if (currentElement.Equals(Head))
{
Head = Head.Next;
return(true);
}
//else take the prev one and overwrite the next with the one behind the deleted
if (previousElement != null)
{
previousElement.Next = currentElement.Next;
return(true);
}
}
//iterating
previousElement = currentElement;
currentElement = currentElement.Next;
}
return(false);
}
//Add new element to the list
public void AddListElement(T data)
{
var newListElement = new LinkedListElementNode <T>(data);
//if head is null, the added element is the first, hence it is the head
if (Head == null)
{
Head = newListElement;
}
else
{
//temp ListElement to avoid overwriting the original
var tempElement = Head;
//iterates through all elements
while (tempElement.Next != null)
{
tempElement = tempElement.Next;
}
//adds the new element to the last one
tempElement.Next = newListElement;
}
}
