recursiveNthNode.c

int findNthNode(Node *head, Node **nthNode, int n){
	if(!head) return 1;
	int count = findNthNode(head->next, nthNode, n);
	//If we have unstack n calls from stack
	if(count == n){
		*nthNode = head;
		return ++count;
	}
	return ++count;
}