In this second of two talks, I will demonstrate a bijection between reduced decompositions and pairs $(\alpha,T)$, where $\alpha$ is a permutation with only one descent and $T$ is a tableaux of shape $\lambda'(\alpha)$. This bijection will make use of the Lascoux-Sch\"{u}tzenberger tree, which will be formally defined. Another consequence (see Part I) of this bijection is a simple combinatorial proof of Lascoux and Sch\"{u}tzenberger's version of the Littlewood-Richardson rule. We will also show some examples of how this bijection relates to the well-known Robinson-Schensted and Edelman-Greene correspondences.