Best writers. Best papers. Let professionals take care of your academic papers

Order a similar paper and get 15% discount on your first order with us
Use the following coupon "FIRST15"
ORDER NOW

style=”color:rgb(0,0,230);”>void add(int pIndex, Integer pData) throws IndexOutOfBoundsException {

public 

style=”color:rgb(0,0,230);”>void add(int pIndex, Integer pData) throws IndexOutOfBoundsException {

   if (pIndex < 0 || pIndex > getSize())

       throw new IndexOutOfBoundsException();

   if (pIndex == getSize()) { //adding node to the end of the list

       Node newNode = new Node(pData, getTail(), null);

       if (isEmpty())

           setHead(newNode);       //////////LINE 1

       else

           getTail().setNext(newNode);  //////////LINE 2

       setTail(newNode);

   }

   else {

       Node node = getNodeAt(pIndex);

       Node newNode = new Node(pData, node.getPrev(), node);

       if (pIndex != 0)

           node.getPrev().setNext(newNode);

       node.setPrev(newNode);

       if (pIndex == 0)

           setHead(newNode);

   }

   setSize(getSize() + 1);

}

Modify the method so that it adds nodes to the end of the linked list.

 
Looking for a Similar Assignment? Order now and Get 10% Discount! Use Coupon Code "Newclient"