@@ -0,0 +1,599 @@
+/*%0A  Insert Node at the end of a linked list%0A  head pointer input could be NULL as well for empty list%0A  Node is defined as%0A  class Node %7B%0A     int data;%0A     Node next;%0A  %7D%0A*/%0A%0Aint GetNode(Node head,int n) %7B%0A%0A    // Create runner and curr nodes%0A    Node runner = head;%0A    Node curr = head;%0A%0A    // Move runner node n spaces ahead of curr%0A    for (int i = 0; i %3C n; i++)%7B runner = runner.next; %7D%0A%0A    // Increment both until runner reaches end of list%0A    while(runner.next != null)%7B%0A        runner = runner.next;%0A        curr = curr.next;%0A    %7D%0A%0A    // Return curr's data%0A    return curr.data;%0A%0A%7D%0A

solve get the val of node n spaces from tail