At the time of writing, I'm not aware of any books that are very specifically about topological data analysis (TDA), apart from the collected papers in Topological Methods in Data Analysis and Visualization and its two sequels, but there are a handful on computational topology that contain valuable background and details for TDA. Gurjeet has already mentioned Afra Zomorodian's Topology for Computing. Others include:
At the moment, knowledge of statistics does not appear to be a prerequisite, although there is some interesting work in that direction at CMU: http://www.stat.cmu.edu/topstat/. It is helpful to be comfortable with multivariable calculus, linear algebra, introductory abstract algebra (especially group theory) and basic point-set topology. Prior acquaintance with algebraic topology and manifolds would be even better. For comparison purposes, it may be interesting to look into clustering algorithms such as $k$-means and hierarchical clustering.
You may want to take a look at Peter Saveliev's Topology Illustrated (which is indeed liberally and helpfully illustrated, so the title is accurate) with its emphasis on homology, and Robert Ghrist's Elementary Applied Topology for a broad-ranging invitation to applied topology. Michael Robinson's Topological Signal Processing could also be of interest.
The importance of the whole: topological data analysis for the
network neuroscientist by Sizemore, Phillips-Cremins, Ghrist & Bassett is a nice introductory paper for a first look at TDA.