Question

In Java:

Assume the "ferrets" variable points to a linked list of "LLNode." Write code that traverses the list and prints the following. Do not forget to consider the case where the list is empty.

$\bullet$ The "LLNode" class is given:

public class LLNode
{
protected T info;
protected LLNode link;

public LLNode(T info)
{
this.info = info;
link = null;
}

public void setInfo(T info)
{
this.info = info;
}
public T getInfo()
{
return info;
}

public void setLink(LLNode link)
{
this.link = link;
}
public LLNode getLink()
{
return link;
}
}  

$\bullet$ The "Ferret" class is to be implemented by you, and it holds "name (String)" and "weight (int)."
$\bullet$ You must use your own implementation of the linked list data structure.
a. The sum of the weight of the ferrets on the list
b. The count of how many ferrets are on the list
c. The names of the ferrets on the list in an alphabetical order
d. The names of the ferrets on the list in a reverse alphabetical order

Hints:
$\bullet$ You need only 3 files: (1) LLNode.java (exactly the same as the given code), (2) Ferret.java (keep it minimal), and (3) TestDriver.java (any name) with main() method
$\bullet$ Example of code to add a node to a linked list is:

LLNode sNode1 = new LLNode("basketball");

LLNode sNode2 = new LLNode("baseball");

sNode1.setLink(sNode2);

- Example of code to traverse a linked list is:

LLNode currNode = letters;

while(currNode != null)

{

System.out.prinln(currNode.getInfo());

currNode = currNode.getLink();

}

$\bullet$ For parts c and d, you need to use another temporary placeholder before the while loop, then output the sorted result after the while loop.

Answer 1

Please find the answers to your questions below. Let me know if you have any doubts. If you are satisfied with the solution, please upvote the answer. Thanks

a) Code to find and display the sum of all numbers on the list.

//assuming numbers point to linked list of Integers

//getting a reference to the head node

LLNode<Integer> temp=numbers;

//initializing sum to 0

int sum=0;

//looping until temp is null

while(temp!=null){

      //adding the info to the sum

      sum+=temp.getInfo();

      //getting next link

      temp=temp.getLink();

}

//displaying the sum

System.out.println(sum);

b) Code to find the count of all elements on the list.

//getting a reference to the head node

LLNode<Integer> temp=numbers;

//initializing count to 0

int count=0;

//looping until temp is null

while(temp!=null){

      //incrementing the count

      count++;

      //getting next link

      temp=temp.getLink();

}

//displaying the count

System.out.println(count);

c) Code to find the count of all positive numbers on the list.

//getting a reference to the head node

LLNode<Integer> temp=numbers;

//initializing count to 0

int count=0;

//looping until temp is null

while(temp!=null){

      //incrementing the count if the number is positive

      if(temp.getInfo()>=0){

            count++;

      }          

      //getting next link

      temp=temp.getLink();

}

//displaying the count

System.out.println(count);

d) Code to display the enumerated contents of list

//getting a reference to the head node

LLNode<Integer> temp = numbers;

// initializing index to 0

int index = 0;

// looping until temp is null

while (temp != null) {

      index++;

      // displaying index number and the number in the list

      System.out.println(index + ".\t" + temp.getInfo());

      // getting next link

      temp = temp.getLink();

}

please upvote