1. Given the following array, draw the binary tree that can be created from its elements. The elements are arranged in the array as discussed in the chapter.

2. A priority queue containing characters is implemented as a heap stored in an array. The precondition states that this priority queue cannot contain duplicate elements. Currently, the priority queue holds 10 elements, as shown below. What values might be stored in array positions 7-9 so that the properties of a heap are satisfied?

3. A priority queue is implemented as a heap:

a. Show how the heap would look after this series of operations:

pg.Enqueue(28);

pg.Enqueue(2);

pg.Enqueue(40);

pg.Dequeue(x);

pg.Dequeue(y);

pg.Dequeue(z);

b. What would the values of x, y, and z be after the series of operations in part (a)?

Given the following array, draw the binary tree that can be created The elements are arranged in the array as discussed in the charter xons ce treenumElements treeelements foi 55 59 44