src/textgen/MyLinkedList.java
public E remove(int index) 
	{
		E data=get(index);
		if (index < 0 || index > size)
		{
			throw new IndexOutOfBoundsException("The index value is invalid");
		}
		LLNode<E> curr = getNode(index);
		LLNode<E> previousNode=curr.prev;
		previousNode.next=curr.next;
		LLNode<E> nextNode=curr.next;
		nextNode.prev=curr.prev;
		size--;
		// TODO: Implement this method(DONE)
		return data;
	}
/** Remove a node at the specified index and return its data element.
	 * @param index The index of the element to remove
	 * @return The data element removed
	 * @throws IndexOutOfBoundsException If index is outside the bounds of the list
	 * 
	 */
Remove a node at the specified index and return its data element.
@param index The index of the element to remove
@return The data element removed
@throws IndexOutOfBoundsException If index is outside the bounds of the list
Remove a node at the specified index and return its data element . @param index The index of the element to remove @return The data element removed @throws IndexOutOfBoundsException If index is outside the bounds of the list
public E remove(int index) 
	{
		E data=get(index);
		if (index < 0 || index > size)
		{
			throw new IndexOutOfBoundsException("The index value is invalid");
		}
		LLNode<E> curr = getNode(index);
		LLNode<E> previousNode=curr.prev;
		previousNode.next=curr.next;
		LLNode<E> nextNode=curr.next;
		nextNode.prev=curr.prev;
		size--;
		return data;
	}
public E remove ( int index ) { E data = get ( index ) ; if ( index < 0 || index > size ) { throw new IndexOutOfBoundsException ( "The index value is invalid" ) ; } LLNode < E > curr = getNode ( index ) ; LLNode < E > previousNode = curr . prev ; previousNode . next = curr . next ; LLNode < E > nextNode = curr . next ; nextNode . prev = curr . prev ; size -- ; return data ; }
Remove a node at the specified index and return its data element.
Remove a node at the specified index and return its data element .
// TODO: Implement this method(DONE)