leaf
if ss == se : NEW_LINE INDENT st [ i ] = ss NEW_LINE return NEW_LINE DEDENT mid = ( ss + se ) >> 1 NEW_LINE segmentTreeConstruction ( ss , mid , 2 * i + 1 ) NEW_LINE segmentTreeConstruction ( mid + 1 , se , 2 * i + 2 ) NEW_LINE if l [ st [ 2 * i + 1 ] ] < l [ st [ 2 * i + 2 ] ] : NEW_LINE INDENT st [ i ] = st [ 2 * i + 1 ] NEW_LINE DEDENT else : NEW_LINE INDENT st [ i ] = st [ 2 * i + 2 ] NEW_LINE DEDENT