 				temp->alpha=-1000000000;
 				temp->beta=1000000000;
             }
-
+            
 			count = 0;
             while(!Q.empty()) {
 				temp = Q.pop();

		__syncthreads();
        //policz w gore
		if(thid == 0) {
			minmax(ch);
		}
		//zwroc wynik (?)
	}

					return NULL;
				else
					seco = firs->next;
				if(seco==NULL || firs->parent != seco->parent) {
					firs->next = NULL;
				}
				this->first = seco;
