if the two nodes belong to same chain , * we can query between their positions in the array * acting as base to the segment tree . After the RMQ , * we can break out as we have no where further to go
if ( chain_u == chain_v ) {