To illustrate my comment, is that what you had in mind?
ListPlot[Transpose[Table[zSeries[999, 100, x], {x, -2, .25, .0001}]],
PlotStyle -> PointSize[Tiny], DataRange -> {-2, .25}]

Addendum: Timing
The OP in his answer provides revised code,
z[0, c_] := c;
z[n_, c_] := z[n - 1, c]^2 + c;
ListPlot[Catenate[Table[{x, #} & /@ NestList[#^2 + x &, z[999, x], 100],
{x, -2, .25, .0001}]], PlotStyle -> PointSize[Tiny]]
which is much faster than the earlier code, requiring 64 sec (AbsoluteTiming) on my PC to generate the plot. Still, it seemed to me that further improvements in time could be achieved. Table requires 37 sec to generate the array, leaving 27 sec for ListPlot itself. Because as many as 100 duplicate points are plotted for x > -1.4, applying DeleteDuplicates offers an obvious savings. (It, like Catenate, takes negligible time.) Using FixedPointList instead of NestList also saves a bit of time for x > -.76, but only a few seconds, because the reduced list generation is largely offset by the test for a fixed point. Together,
ListPlot[Catenate[Table[{x, #} & /@ DeleteDuplicates[
FixedPointList[#^2 + x &, z[999, x], 100]], {x, -2, .25, .0001}]],
PlotStyle -> PointSize[Tiny], PlotRange -> All]
requires only about 41 sec. The other opportunity for savings involves replacing z[999, x], which takes some 31 sec in all, by the equivalent Nest[#^2 + x &, x, 999],
ListPlot[Catenate[Table[{x, #} & /@ DeleteDuplicates[
FixedPointList[#^2 + x &, Evaluate[Nest[#^2 + x &, x, 999]], 100]],
{x, -2, .25, .0001}]], PlotStyle -> PointSize[Tiny], PlotRange -> All]
which reduces total time to 11 sec, a significant improvement. (Using FixedPoint instead of Nest offers no further advantage.)
DataRangeoption inListPlot. – bbgodfrey Feb 18 '16 at 01:41DataRangeso that the horizontal axis is in the right units. Look at the docs for it. BTW,NestList[]is pretty useful for implementing yourzSeries. – J. M.'s missing motivation Feb 18 '16 at 02:05{c, #} & /@ serafter generating them like in your original version. – J. M.'s missing motivation Feb 18 '16 at 02:41Do[AppendTo[res, f[x]], {x, n}]is the same asres = Table[f[x], {x, n}], only 100 times slower (ignoring the time to computef[x])? – Michael E2 Feb 18 '16 at 02:48NestList[]; repeated use ofAppendTo[]is well-known to be a slow way of accumulating results. – J. M.'s missing motivation Feb 18 '16 at 02:50