<t>I had found this article...But when he says :" we match these by branching from x*i,j to one of x*i+1,k-1 x*i+1,k and x*i+1,k+1 where k is chosen so that x*i+1,k is as close as possible to x*i,j+Mi x*i,j deltaT....for node i,j+1 you won't necessary branch from x*i,j+1 to one of x*i+1,k x*i+1,k+1 ...

I'd like to implement the case where volatility parameters are time dependent.I search more information about branchings ,probability....Do we obtain a recombining tree with this method?