Such structures might seem advantageous in allowing the semantics of the example to be computed directly by compositional rules and defeasible inference.
both structures are directed acyclic graphs (DAGs), with acyclicity the only constraint on what nodes can be connected.