We give a combinatorial proof that two-stack sortable permutations are equinumerous with rooted nonseparable planar maps, by making use of the concept of generating trees. To be precise, we construct generating trees for both objects under consideration and show that they are isomorphic. A detailed study of the correspondence allows us to conclude refined enumeration results where we are also able to keep track of several parameters defined for these permutations, respectively these maps.