Question

Write a method in java that removes a range of Nodes in a Doubly LinkedList. A method shall remove from start inclusive and stop exclusive.

// instance variables already defined
int size;
private Node<E> head;
private Node<E> tail;

// Already defined methods which can be used

getNext(), setNext(), getPrev(), setPrev()

// complete the method

// be sure to check for special cases

public void remove (int start, int stop)

{

}

Answer 1

public void remove (int start, int stop)
{
    Node<E> temp = head;
    int i = 0;
    while(i<start){
        temp = temp.getNext();
        i++;
    }
    while(i<stop){
        temp.setNext(temp.getNext().getNext());
        i++;
    }
}