We define directed rooted labeled and unlabeled trees and find measure
s on the space of directed rooted unlabeled trees which are invariant
with respect to transition probabilities corresponding to a biased ran
dom walk on a directed rooted labeled tree. We use these to calculate
the speed of a biased random walk on directed rooted labeled trees. Th
e results are mainly applied to directed trees with recurrent subtrees
, where the random walker cannot escape.