public int size()
	{
		int i = 0;
		if (this.getFirstNode() == null) return i; else i++;
		if (firstNode.getNext() != null)
		{
			DListNode<T> nextNode = firstNode.getNext();
			while (nextNode.getNext() != null)
			{
				i++;
				nextNode = nextNode.getNext();
			}
		}
		else
		{
			return i;
		}
		i++;
		return i;
	}