CareerCup_2.2 - Find element kth to last

KthToLast.java

package Chapter2;

public class KthToLast {
    public static <T> Node<T> kthToLast(MyLinkedList<T> list, int k) {
	if (list.head == null)
	    return null;
	Node<T> fir = list.head;
	for (int i = 1; i < k; i++) {
	    if (fir.next == null)
		return null;
	    fir = fir.next;
	}

	// runner tech
	Node<T> sec = list.head;
	while (fir.next != null) {
	    fir = fir.next;
	    sec = sec.next;
	}

	return sec;
    }

    public static void main(String[] args) {
	MyLinkedList<Integer> list = new MyLinkedList<>(new Integer[] { 1, 2,
		3, 4, 5, 6, 7, 8, 9, 10 });
	for (int i = 1; i <= 11; i++) {
            	    System.out.println(i + "'s to the last element is " + 
            		    (kthToLast(list, i) == null ? "null " : kthToLast(list, i).data));
	}
    }
}

MyLinkedList.java

package Chapter2;

//Singly Linked List
public class MyLinkedList<T> {
    public Node<T> head;

    public MyLinkedList(Node<T> h) {
	head = h;
    }

    public MyLinkedList(T[] dataArray) {
	if (dataArray == null || dataArray.length <= 0)
	    return;
	head = new Node<>(dataArray[0], null);
	Node<T> node = head;
	for (int i = 1; i < dataArray.length; i++) {
	    node.next = new Node<T>(dataArray[i], null);
	    node = node.next;
	}
    }

    public void print() {
	Node<T> cur = head;
	while (cur != null) {
	    System.out.print(cur.data);
	    if (cur.next != null) {
		System.out.print(" -> ");
	    }
	    cur = cur.next;
	}
	System.out.println();
    }
}

Node.java

package Chapter2;

public class Node<T> {
    public T data;
    public Node<T> next;
    
    public Node(T d, Node<T> n){
	data = d;
	next = n;
    }
}