For sequent presentation of ◊,□, antecedent tree structures now are built out of formulas by means of unary and binary tree-building operations, (–) and (–,–).  The residuation pattern then gives rise to the following left and right introduction rules.  Cut elimination carries over straightforwardly to the extended system, and with it decidability and the subformula property.