/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public int kthToLast(ListNode head, int k) {
ListNode left=head;
ListNode right=head;
while(k>1){
right=right.next;
k--;
}
while(right.next!=null){
left=left.next;
right=right.next;
}
return left.val;
}
}