A mixed dominating set  of a connected graph  is a mixed tree dominating set of G if the elements of S along with the ends of the edges in it constitute a tree. A mixed tree dominating set S is a minimal mixed tree dominating set if no proper subset of S is a mixed tree dominating set. The mixed tree domination number  of G is the minimum cardinality of a mixed tree dominating set. In this paper, we include some basic results on mixed tree domination, bounds on  and its exact values for some standard graphs.