tree insert( new, pq )
	tree new, pq;

	{
	if ( pq==NULL )	return( new );
	else if ( pq->k > new->k ) {
			pq->right = insert( new, pq->right );
			fixdist( pq );
			return( pq );
			}
	else	{
		new->left = pq;
		return( new );
		}
	};