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) {
  }

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

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

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

    Node head = new Node(10);

  }

}

@@ -169,32 +169,212 @@
 ail(int data) %7B%0A
+    Node curr = this;%0A    Node end = new Node(data); // calling the constructor%0A    while(curr.next != null) %7B%0A      curr = curr.next; // get to the end%0A    %7D%0A    curr.next = end;%0A
   %7D%0A%0A  // Iterat

Implement appendToTail.