This is a selection of 19 papers from a joint 1992 CAAP/ESOP (Colloquium on Trees in Algebra and Programming/ European Symposium on Programming) meeting, which covers discrete data structures (graphs, equations, transformations of graphs), and their links with logical computing theories (material extended from CAAP's original work on algebraic and combinatorial properties of trees).