void meeting(rbtree *tree){
	rbnode *r = tree->root;
	rbnode *q = tree->root;
	orario *arr, *part;
	int i;
	while(q){
		q->inc = createlist();
		while(r){
			arr = r->t->arrivo;
			part = r->t->partenza;
			if(compare(q->t->arrivo, arr)>=0 && compare(q->t->partenza, part)<=0)
				insertlist(q->inc,r->t);
			else
				r=treesucc(tree,r);
		}
		r = tree->root;
		while(r){
			arr = r->t->arrivo;
			part = r->t->partenza;
			if(compare(q->t->arrivo, arr) >= 0 && compare(q->t->partenza, part)<=0){
				i = existinlist(q->inc, r->t);
				if(i == 0)
					insertlist(q->inc,r->t);
			}
			else
				r=treepred(tree,r);
		}
		q = treesucc(tree,q);
	}
	q = tree->root;
	while(q){
		r = tree->root;
		while(r){
			arr = r->t->arrivo;
			part = r->t->partenza;
			if(compare(q->t->arrivo, arr)>=0 && compare(q->t->partenza, part)<=0)
				i = existinlist(q->inc, r->t);
				if(i == 0)
					insertlist(q->inc,r->t);
			else
				r=treepred(tree,r);
		}
		r = tree->root;
		while(r){
			arr = r->t->arrivo;
			part = r->t->partenza;
			if(compare(q->t->arrivo, arr) >= 0 && compare(q->t->partenza, part)<=0){
				i = existinlist(q->inc, r->t);
				if(i == 0)
					insertlist(q->inc,r->t);
			}
			else
				r=treepred(tree,r);
		}
		q = treepred(tree,q);
	}




}