tour right subtree if exists , and remark euler and level arrays for parent on return
if ( node . right != null ) { eulerTour ( node . right , l + 1 ) ; euler [ fill ] = node . data ; level [ fill ] = l ; fill ++ ; } } }