On-line arbitrarily vertex decomposable trees

A tree T   is arbitrarily vertex decomposable if for any sequence ττ of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T   whose orders are given by ττ. An on-line version of the problem of characterizing arbitrarily vertex decomposable trees is completely solved here.