tour left subtree if exists , and remark euler and level arrays for parent on return
if ( root -> left ) { eulerTour ( root -> left , l + 1 ) ; euler [ ind ] = root -> key ; level [ ind ] = l ; ind ++ ; }