void printorario(rbtree *tree, orario *x){
	rbnode *q, *r = tree->root;
	while(r){
		if((compare(r->t->arrivo, x)<0)&&(compare(r->t->partenza, x)>0))
			printf("%s\n", r->t->nome);
		q=treesucc(tree,r);
		if(q==NULL)
			q=treepred(tree,r);
		r=q;
	}
}