Write a recursive method that prints out the data elements of a linked list in reverse order.
Your method should take in as a parameter the head reference to a linked list. Then, write
a recursive method that returns a count of the number of elements greater than a given
threshold
im currently stuck in the recursive method that returns a count of the number of elements greater than a threshold
this is what i have
import java.util.Arrays;
import java.util.Collection;
public class recursion3
{
public static void main(String [] args)
{
char a [] = {'A', 'B','C','D','E'};
StringReverse(a,5);
}
public static void StringReverse(char[] a, int size)
{
for (int i = size-1; i >= 0 ; i--)
{
System.out.print(a[i]);
}
}
public static int count(char a)
{
int start;
int end;
if(start==null)
return 0;
else
return StringReverse(a, start, end-1, count);
}
}
