  In this paper we introduce a numerical method for optimal stopping in the
framework of one dimensional diffusion. We use the Skorokhod embedding in order
to construct recombining tree approximations for diffusions with general
coefficients. This technique allows us to determine convergence rates and
construct nearly optimal stopping times which are optimal at the same rate.
Finally, we demonstrate the efficiency of our scheme with several examples of
game options.
