(\mathbb{N}^k, \le), the set of vectors of k natural numbers (where k is finite) with component-wise ordering, is a well partial order (Dickson's lemma).
Embedding between finite trees with nodes labeled by elements of a wqo (X, \le) is a wqo (Kruskal's tree theorem).