the tree fragments being constructed) with data structures with linear-time sequential access (either a stack, or a stack coupled with a double-ended queue).
these systems need to perform at least n actions to construct a new constituent from two subtrees separated by n intervening subtrees.