Find minimum and maximum value in the path from LCA to b
for ( ; j < Path2 . Count ; j ++ ) { if ( min2 > ( int ) Path2 [ j ] ) min2 = ( int ) Path2 [ j ] ; if ( max2 < ( int ) Path2 [ j ] ) max2 = ( int ) Path2 [ j ] ; }