Finding And Printing Median Node In Linked List Using Recursion

The only problem I have now is getting a method to return the median element of a LinkedList without using loops of any kind or by using a global counter anywhere.

I've pretty easily figured out how to get the index value for the median number (there is some lee way allowed. If the list has an even size, any of the middle values are accepted) but I can't figure out how to print it without loops.

I'm sure I need to make a method that finds an element at the given index value, but I don't know how to do it without loops.

Here's all of my code. Inside is my Assignment3 class I use for testing, StudentList which contains the LinkedList head and other List methods, and StudentNode which is obviously, the Node class. Also I've attached the first test1.txt file as well.

import java.io.FileNotFoundException;
import java.util.*;
public class Assignment3 {
public static void main (String []args){
StudentList<StudentNode> myList = new StudentList<StudentNode>();

[Code] .....

I tried making a method that basically counts up the list recursively then a second method that counts down recursively and is supposed to stop once it hits the middle number, then print that node.

Attached File(s) : test1.txt (106bytes)