“…In Walsh (2003), the author works with exponential binomial trees and, by embedding techniques, he obtains an expansion of the error; this is a really stronger result than ours, but it holds for functions which are at least piecewise C 2 : For similar convergence problems involving the maximum process, one can also see Baldi (1995), Baldi and Caramellino (2002), Gobet (2000) (all connected with the barrier case), and Tonou (1997), where there is only a partial proof, but for a more general context.…”