An analogue of the plactic monoid for binary search trees
  We introduce a monoid structure on a certain set of labelled binary trees, by a process similar to the construction of the plactic monoid. This leads to a new interpretation of the algebra of planar binary trees of Loday-Ronco. 
Florent Hivert, Jean-Christophe Novelli, Jean-Yves Thibon