Running the eulers tour on LCP(lowest common prefix) array

Hi ,

does anyone know how to efficiently do the eulers tour on LCP array??

(any hint link anything is helpfull)


thank you,

baxy