On better quasi-ordering countable trees

The main result is that the class of countable trees is better-quasi-ordered under embeddability. R. Laver proved before that a certain class of well-founded trees is b.q.o. Actually our better-quasi-ordered class is larger than the countable class but does not contain Suslin like-trees nor certain Galvin trees of height ω + 1.