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

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

				temp->beta=1000000000;
				V[count]=temp;
				count++;
			}	
		}
		__syncthreads();
        //policz dla tych w V
		if(thid<count)
