chintanparikh

import static org.junit.Assert.*;

import org.junit.Test;
import org.junit.Before;

import java.util.ArrayList;

/**
 * Linked List Tests
 * @author Chintan

chintanparikh

  	assertTrue(list.remove(0).equals(j));

chintanparikh

@Override
  public E remove(int index) throws IndexOutOfBoundsException{
  	if (index >= size || index < 0) throw new IndexOutOfBoundsException();
		
		Node<E> prev = null, temp = head;
		E data;
		int a = 0;
		
		// Set temp to the node to be deleted
		while(a != index)

chintanparikh

@Override
  public E remove(int index) throws IndexOutOfBoundsException{
		if (index >= size || index < 0) throw new IndexOutOfBoundsException();
		
		Node<E> prev = null, temp = head;
		E data;
		int a = 0;
		
		// Set temp to the node to be deleted
		while(a != index)

chintanparikh

@Test
  public void testRemoveInt() {
		list.add(i);
		list.add(j);
		assertTrue(list.remove(0).equals(i));
		assertFalse(list.getHead().equals(i));
		System.out.println(list.getHead().getData());
		assertTrue(list.getHead().equals(j));
		assertTrue(list.remove(0).equals(j));
		assertTrue(list.getHead() == null);

chintanparikh

@Override
  public E remove(int index) throws IndexOutOfBoundsException{
		if (index >= size || index < 0) throw new IndexOutOfBoundsException();
		
		Node<E> prev = null, temp = head;
		E data;
		int a = 0;
		
		// Set temp to the node to be deleted
		while(a != index)

chintanparikh

import java.util.Collection;

/**
 * This is a circular, singly linked list.
 */
public class LinkedList<E> implements List<E> {

  protected Node<E> head;
	protected Node<E> tail;

chintanparikh

@Test
  public void testRemoveInt() {
		list.add(i);
		list.add(j);
		assertTrue(list.remove(0).equals(i));
		assertFalse(list.getHead().equals(i));
		assertTrue(list.getHead().equals(j));
		assertTrue(list.remove(0).equals(j));
		assertTrue(list.getHead() == null);
		list.add(i);

chintanparikh

@Override
  public E remove(int index) throws IndexOutOfBoundsException{
		if (index >= size || index < 0) throw new IndexOutOfBoundsException();
		
		Node<E> prev = null, temp = head;
		E data;
		int a = 0;
		
		// Set temp to the node to be deleted
		while(a != index)

chintanparikh

import java.util.Collection;

/**
 * This is a circular, singly linked list.
 */
public class LinkedList<E> implements List<E> {

  protected Node<E> head;
  protected Node<E> tail;