Question

1. Implement Doubly Linked List get method which behaves like the operator [] of array. - It takes an integer parameter i as the index, it throw an Exception if the index i is illegal, returns the element at given index i, it traverse from the header of the list if index i is in the lower end of the list(less than half of the size), and traverse from the trailer of the list if index i is in the higher end of the list. Part of the code is given, you need to write the loops so that ansNode is referencing the correct node.

Answer 1

//Java program

public E get(int i) throws Exception{
   if(i<0 || i>=size)throw new Exception("Bad Index");
   DNode<E> ansNode;
   if(i<size/2){
       ansNode = header.getNext();
       for(int k=0;k<i;k++)ansNode = ansNode.getNext();
   }
   else{
       ansNode = trailer.getPrev();
       for(int k=0;k<(size-(i+1));k++)ansNode = ansNode.getPrev();
   }
   return ansNode.getE();
}