tree insert( new, pq )
	tree new, pq;
	{
	new->left = new;	new->right = new;
	return( merge( pq, new ) );
	};