function recursive(k, n = this.head, i = 0) {
  if(n) {
    let res = recursive(k, n.next, i+1);

    if(res.index === i) {
      res.node = n.data;
    }

    if(i === 0) {
      return res.node;
    } else {
      return res;
    }
  } else {
    return {node: undefined, index: i - k};
  }
}
O (n) and O(n) space
@param k
@param n
@param i
@returns {*}