void insert( node *&tmp, int val_x ) {
    if( tmp == NULL ) {
        tmp = new node;
        tmp -> val = val_x;
        return;
    }
    SOL++;
    if( val_x < tmp -> val ) insert( tmp -> left, val_x );
    else insert( tmp -> right, val_x );
}