Mine

	for (i=0; i<val; i++)	{		ris=albero_visit(albero, POSTORDER);		x=idnt;		while (x!=NULL) 		{			printf("%c=%2.1f ", x->ident, x->valori[x->n_curr]);			if ((x->n_curr++)==(x->n_valori-1))				x->n_curr=0;			x=x->next;		}		printf(", valore risultante=%2.2f\n", ris);		printf("%s", buf);	}