Description
Write the routines to do a
Input
where int p is the position of the element, and PriorityQueue is defined as the following:
typedef struct HeapStruct *PriorityQueue;
struct HeapStruct {
ElementType *Elements;
int Capacity;
int Size;
};
Output
return deleted number and the remaining elements of queue H
9
1 10
1 5
1 2
0
1 9
1 1
1 4
0
0