Complete the Link class by writing the 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. 2) Write a recursive instance method isSorted that takes a Link parameter and determines whether a linked list is sorted in descending order or not (return a boolean value). 3) Write a recursive instance method named findBad that takes no parameters and returns a reference to a Link. The result of calling findBad is a reference to the first link that has a value greater than the next link's value. If no such link exists return null. For example, for {5→6→7→3→2} it would return a reference to the third link ("7").
Complete the Link class by writing the 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.
2) Write a recursive instance method isSorted that takes a Link parameter and determines whether a linked list is sorted in descending order or not (return a boolean value).
3) Write a recursive instance method named findBad that takes no parameters and returns a reference to a Link. The result of calling findBad is a reference to the first link that has a value greater than the next link's value. If no such link exists return null. For example, for {5→6→7→3→2} it would return a reference to the third link ("7").
Step by step
Solved in 3 steps with 1 images
