Bounds on the unavoidability of some classes of directed trees, and algorithms for showing such embeddings.