The study of a tree introduced by Lascoux-Schutzenberger yields a family of tableaux correspondences which can be used to enumerate the number of reduced factorizations of a permutation. Representing reduced words by certain line diagrams, these corresponences can be obtained by an algorithm of D. Little in a remarkably simple manner. The talk uses a beautiful Applet also created by D. Little which illustrates the algorithm and should be helful in any further studies of reduced words.