public class Node {

  Node next = null;
  int data;

  public Node(int d) {
    data = d;
  }

  // Appends data to the end of the linked list
  private void appendToTail(int data) {

    Node curr = this;
    Node end = new Node(data);

    while(curr.next != null) {
      curr = curr.next;
    }

    curr.next = end;
  }

  // Iterate through the linked list
  private void traverseList() {
  }

  // Delete the node from linked list n with data
  private void delete(Node n, int data) {
  }

  // Find the median element in the linked list
  private Node findMedianElement() {
    Node curr     = this;
    Node hopOnce  = curr;
    Node hopTwice = curr;

    while(true) {

      // Weve reached the end of the list, hopOnce is the median.
      if (hopTwice.next == null) {
        System.out.println("End Node Value: \t"    + hopTwice.data);
        System.out.println("Median Node Value: \t" + hopOnce.data);
        return hopOnce;
      }

      // hopTwice is one Node from the end, go to the end
      else if (hopTwice.next.next == null) {
        hopTwice = hopTwice.next;
      }

      else {
        hopOnce = hopOnce.next;
        hopTwice = hopTwice.next.next;
      }
    }
  }


  // Example function calls
  public static void main(String[] args) {

    Node head = new Node(10);
    head.appendToTail(15);
    head.appendToTail(20);
    head.appendToTail(25);
    head.appendToTail(30);
    head.appendToTail(35);
    head.appendToTail(40);
    head.appendToTail(45);
    head.findMedianElement();

  }

}

@@ -213,16 +213,17 @@
 ode end 
+ 
 = new No
@@ -232,16 +232,16 @@
 (data);%0A
-
 %0A    whi
@@ -316,16 +316,28 @@
  = end;%0A
+    return;%0A
   %7D%0A%0A  /
@@ -362,32 +362,32 @@
 the linked list%0A
-
   private void t
@@ -398,24 +398,204 @@
 rseList() %7B%0A
+    Node curr = this;%0A%0A    while(curr != null) %7B%0A      System.out.println(%0A        %22Node: %22    + curr +%0A        %22%5CtValue: %22 + curr.data);%0A      curr = curr.next;%0A    %7D%0A    return;%0A
   %7D%0A%0A  // De
@@ -1688,32 +1688,27 @@
    head.
-findMedianElemen
+traverseLis
 t();%0A%0A  

Add traverseList for linked list.