Recursively, as a data type a tree is defined as a value (of some data type, possibly empty), together with a list of trees (possibly an empty list), the subtrees of its children; symbolically: (A tree t consists of a value v and a list of other trees.). y The partial orders ≤V and ≤Hare complementary: As a consequence, the "concordant" linear order