Complete the Link class by writing methods described below. Do not use loops, or create any more methods (other than those specified), class or instance variables. public class Link { private Link next; //null if this is the last link private int value; public Link(Link n, int v) { next = n; value = v; } } Do not use loops, or create any more methods (other than those specified), class or instance variables. 1. Write a recursive instance method count that takes no parameters and returns an int. Return the number of links that hold the value zero, with the exception that the last link in the list is not included in the count. For example, for the linked list, {(first) 5→0→3→1→0→0 (last)} it would return the value 2.
Complete the Link class by writing methods described below. Do not use loops, or
create any more methods (other than those specified), class or instance variables.
public class Link
{
private Link next; //null if this is the last link
private int value;
public Link(Link n, int v)
{
next = n;
value = v;
}
}
Do not use loops, or create any more methods (other than those specified), class or instance
variables.
1. Write a recursive instance method count that takes no parameters and returns an int. Return
the number of links that hold the value zero, with the exception that the last link in the list is not
included in the count. For example, for the linked list, {(first) 5→0→3→1→0→0 (last)} it
would return the value 2.
In this question we need to complete the given Link class where we need to implement a method which counts the no of zeros in the linked list except the last element's zero value.
Step by step
Solved in 4 steps with 1 images