if key node found , store current node and recur for left and right childrens
ancestors [ index ] = root NEW_LINE return min ( findClosestUtil ( root . left , k , ancestors , index + 1 ) , findClosestUtil ( root . right , k , ancestors , index + 1 ) ) NEW_LINE