Question: Question 3: Matching. This exercise is about how to represent a heap H as an array A . We assume that the first element has
Question 3: Matching.
This exercise is about how to represent a heap H as an array A. We assume that the first element has index 1. Consider this heap H :

Match each key K with its index i in the array A.
Group of answer choices
9 [ Choose ] 5 7 9 6 2 1 3 4 8
10 [ Choose ] 5 7 9 6 2 1 3 4 8
14 [ Choose ] 5 7 9 6 2 1 3 4 8
1 [ Choose ] 5 7 9 6 2 1 3 4 8
2 [ Choose ] 5 7 9 6 2 1 3 4 8
4 3 2 i 16 9 10 14 8 7
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
