On the basins of attraction of a one-dimensional family of root finding algorithms : from Newton to Traub