Trees are constructed over the inductive graph type and are characterised by vertices not repeating in the leaves.
Trees are constructed over the inductive graph type and are characterised by vertices not repeating in the leaves. they implement the TreeA interface. A simple datastrcuture for trees can be found in the algebraic package
We first define the TreeA trait for trees