public E get(int index) throws IndexOutOfBoundsException
	{
		if(index >= size || index < 0)
			throw new IndexOutOfBoundsException();
		int count;
		Node temp;
		//Occurs if index is towards the end of the list
		if(index > size/2){
			count = size;
			temp = tail;
			while(--count >= index)
				temp = temp.prev;
			return temp.data;
		}
		
		//This occurs if index <= size/2
		count = -1;
		temp = head;
		while(++count <= index){
			temp = temp.next;
		}
		return temp.data;
	}