Smatchcube's website 🌍


Exercise 2.65

My solution is to transform trees in ordered lists, apply reunion or intersection and then transform the ordered list in the tree format. As we already wrote theses procedures this is straightforward, theses procedures are all \((n)\) so union-set and intersection-set are also \((n)\).