A tree coding theorem is established for discrete-time abstract alphabet stationary block-ergodic sources under a single-letter fidelity criterion. The proof of this theorem uses recent results from the theory of branching processes with random environments. The relation to previous work in tree coding is also discussed.