Add the nodes which are less than current node in left [ ]
for ( int i = 0 ; i < left . size ( ) ; i ++ ) { if ( left . get ( i ) < root . key ) { count += 1 ; } combined . add ( left . get ( i ) ) ; }