public class UnorderedLinkedList extends LinkedListClass
{

	public UnorderedLinkedList()
	{
	   	super();
	}

	public UnorderedLinkedList(UnorderedLinkedList otherList)
	{
	  	super(otherList);
    }

       	//Method to determine whether searchItem is in
		//the list.
		//Postcondition: Returns true if searchItem is found
		//               in the list; otherwise, it returns
        //               false.
    public boolean search(DataElement searchItem)
    {
        Node current; //pointer to traverse the list
  	    boolean found;

	    current = first;  //set current pointing to the first
 		 				  //node in the list

		found = false;    //set found to false

		while(current != null && !found) 		//search the list
			if(current.info.equals(searchItem)) //item is found
       			found = true;
			else
				current = current.link; //make current point to
           								//the next node
		return found;
    }

	  	//Method to delete deleteItem from the list.
		//Postcondition: If found, the node containing
		//               deleteItem is deleted from the
		//               list, first points to the first
		//               node, and last points to the last
      	//               node of the updated list.
    public void deleteNode(DataElement deleteItem)
    {
		Node current; //pointer to traverse the list
		Node trailCurrent; //pointer just before current
		boolean found;

	 	if(first == null)    //Case 1; list is empty.
		 	System.err.println("Can not delete from an empty list.");
	  	else
	   	{
		  	if(first.info.equals(deleteItem)) //Case 2
		   	{
			   	current = first;
			   	first = first.link;
			 	if(first == null)    //list had only one node
                   last = null;
			   	current.link = null;
                current = null;
                count--;
		  	}
		   	else  //search the list for the node with the given info
		  	{
				found = false;
				trailCurrent = first;   //set trailCurrent to point to
										//the first node
			  	current = first.link;	//set current to point to the
    									 //second node

			   	while(current != null && !found)
			  	{
  					if(current.info.equals(deleteItem))
                		found = true;
                  	else
				  	{
					   	trailCurrent = current;
					   	current = current. link;
                   	}
			   	} // end while

                if(found) //Case 3; if found, delete the node
			   	{
				 	count--;
                    trailCurrent.link = current.link;

				   	if(last == current)		//node to be deleted was
											//the last node
					  	last = trailCurrent;	//update the value of last

                    current.link = null;
				   	current = null;
			  	}
			   	else
				  	System.out.println("Item to be deleted is "
				                  	 + "not in the list.");
		   	} //end else
	   	} //end else
    } //end deleteNode

    public void finalize()
    {
        super.finalize();
    }
}