Can anybody solve this programming challenge please ASAP? Linked Bag public clas

Question

Can anybody solve this programming challenge please ASAP?

Linked Bag

public class LinkedBag<E extends Comparable <E>>
{ // main class
   //declare variables
   private Node<E> head;
   private int numElements;
  
   public LinkedBag() {
   head = null;
   numElements = 0;
   }
   /**
   * getSize method returns value in numElements field
   * @return value in numElements field
   */
   public int getSize()
   {
   return numElements;
   }
  
   /**
   * add method returns value in numElements field
   * @param element hold the value of numElements
   */
   public void add(E element) {
   head = new StringNode(element, head);
   numElements++;
   }
   /**
   * countOccurrences method returns value in numOccurrences field
   * @param target
   * @return value in numOccurrences field
   */
   public int countOccurrences(E target) {
   StringNode cursor = head;
   int numOccurrences = 0;
   for (cursor = head; cursor != null; cursor = cursor.getLink()) {
   if (cursor.getData().equalsIgnoreCase(target)) {
   numOccurrences++;
   }
   }
   return numOccurrences;
   }
  
   **
   * exists method returns value in found field
   * @param target
   * @return value in found field
   */
   public boolean exists(E target) {
   boolean found = false;
   StringNode cursor = head;

   while (cursor != null && !found) {
   if (cursor.getData().equalsIgnoreCase(target)) {
   found = true;
   } else {
   cursor = cursor.getLink();
   }
   }
   return found;
   }
  
   /**
   * remove method returns value in found field
   * @param target
   * @return value in found field
   */
   public boolean remove(E target) {
   StringNode cursor = head;
   boolean found = false;

   while (cursor!= null && !found)
   {
   if (cursor.getData().equalsIgnoreCase(target))
   found = true;
   else
   cursor = cursor.getLink();
   }
  
   if (found) {
  
   cursor.setData(head.getData());
   head = head.getLink();
   numElements++;
   }
   return found;
   }
     
   @Override
   public String toString() {
   String stringToReturn = "";
   StringNode cursor;

   if (numElements == 0) {
   stringToReturn = "empty";
   } else {
   for (cursor = head; cursor != null; cursor = cursor.getLink()) {
   stringToReturn = stringToReturn + cursor.getData();
   if (cursor.getLink() != null) {
   stringToReturn = stringToReturn + ", ";
   }
   }
   }
   return stringToReturn;
   }

  
   }

} // main class ends

The idea is that the Graph will be a collection of vertexes (Place) and edges (linked list of Place) The driver will create the Graph. You don't have to use the house but it is used here as an illustration UML for Place Place -description: String -neighborsLinkedList:LinkedBag

Explanation / Answer

public category LinkedBag&lt;E extends Comparable &lt;E&gt;&gt;
{ // main category
//declare variables
non-public Node&lt;E&gt; head;
non-public int numElements;
  
public LinkedBag()
/**
* getSize methodology returns price in numElements field
* @return price in numElements field
*/
public int getSize()
come back numElements;
}
  
/**
* add methodology returns price in numElements field
* @param part hold the worth of numElements
*/
public void add(E element)
/**
* countOccurrences methodology returns price in numOccurrences field
* @param target
* @return price in numOccurrences field
*/
public int countOccurrences(E target) indicator = head;
int numOccurrences = 0;
for (cursor = head; indicator != null; indicator = indicator.getLink())
}
come back numOccurrences;
}
  
**
* exists methodology returns price in found field
* @param target
* @return price in found field
*/
public mathematician exists(E target) {
mathematician found = false;
StringNode indicator = head;
whereas (cursor != null &amp;&amp; !found) else {
indicator = indicator.getLink();
}
}
come back found;
}
  
/**
* take away methodology returns price in found field
* @param target
* @return price in found field
*/
public mathematician remove(E target) indicator = head;
mathematician found = false;
whereas (cursor!= null &amp;&amp; !found)
{
if (cursor.getData().equalsIgnoreCase(target))
found = true;
else
indicator = indicator.getLink();
}
  
if (found)
come back found;
}

@Override
public String toString()

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.