public T get(int index) {
		
		if (index < 0 || index >= this.size) throw new IndexOutOfBoundsException();
		
		//	handle ask for head
		if (index == 0) return this.head.data;
		
		//	handle ask for tail
		else if (index == this.size - 1) return this.tail.data;
		
		//	handle ask for anything else
		else {
			
			MyNode current = this.head;
			
			for (int i = 0; i < index; i++) current = current.next;
			
			return current.data;
			
		}
		
	}