******** fig6.30 **********

	/* Delete_min1 returns the new tree; to get the minimum use find_min */
	/* This is for convenience. */

	PRIORITY_QUEUE
	delete_min1( PRIORITY_QUEUE H )
	{
		PRIORITY_QUEUE left_heap, right_heap;

/*1*/		left_heap = H->left;
/*2*/		right_heap = H->right;
/*3*/		free( H );
/*4*/		return merge( left_heap, right_heap );
	}