get(int index) function linked lists

[Dekker1]

Hello just want to find out if this code is right or can something change?

  template<class T>	
T LinkedList<T>::get(int index) const 
{
	Node<T>* nodePtr;
	Node<T>* nodeReturn;
	int count = 0;
	
	nodePtr = head;
	int number = size();
	
	if(nodePtr == NULL)
	{
		throw "The list is empty.";
	}
	else
	{
		if((index >= 0) && (index <= number))
		{
			while(nodePtr != NULL)
			{
				if(count == index )
				{
					return nodePtr->data;
				}
				count++;
				nodeReturn = nodePtr;
				nodePtr = nodePtr->next;
			}
		}
		else
		{
			throw "Invalid index.";
		}
	}
}

[AbstractionAnon]

Line 5,26: What's the purpose of nodeReturn? It's not used.

Line 17: Assuming index is zero based, your upper bounds check is faulty. Let's assume size() is 5, then valid indexes would be 0-4 just like an array.