Compare in - time , out - time and level of i - th node to the respective extremes among all nodes of the given set
if ( t_in [ i ] <= mint && t_out [ i ] >= maxt && level [ i ] > l ) { node = i ; l = level [ i ] ; } } return node ; }