Consider a type of binary trees where the nodes are labeled with an arbitrary type A:Set and define the relation "t is the left or right subtree of t'" Show that this relation is well-founded (Please give two different proofs.)
Follow this link