/**
* LinkedList class implements a doubly-linked list.
*/
public class MyLinkedList<AnyType> implements Iterable<AnyType>
{
/**
* Construct an empty LinkedList.
*/
public MyLinkedList( )
{
   doClear( );
}

private void clear( )
{
   doClear( );
}

/**
* Change the size of this collection to zero.
*/
public void doClear( )
{
   beginMarker = new Node<>( null, null, null );
   endMarker = new Node<>( null, beginMarker, null );
   beginMarker.next = endMarker;

   theSize = 0;
   modCount++;
}

/**
* Returns the number of items in this collection.
* @return the number of items in this collection.
*/
public int size( )
{
   return theSize;
}

public boolean isEmpty( )
{
   return size( ) == 0;
}

/**
* Adds an item to this collection, at the end.
* @param x any object.
* @return true.
*/
public boolean add( AnyType x )
{
   add( size( ), x );
   return true;
}

/**
* Adds an item to this collection, at specified position.
* Items at or after that position are slid one position higher.
* @param x any object.
* @param idx position to add at.
* @throws IndexOutOfBoundsException if idx is not between 0 and size(), inclusive.
*/
public void add( int idx, AnyType x )
{
   addBefore( getNode( idx, 0, size( ) ), x );
}

/**
* Adds an item to thi

Towers of Hanoi VIDEO The 'Towers of Hanoi is a classic problem u...