Question: question 3 A ternary max-heap is similar to the binary max-heap that we have discussed in class, but now non-leaf nodes can have 3 children
question 3
A ternary max-heap is similar to the binary max-heap that we have discussed in class, but now non-leaf nodes can have 3 children instead of 2. A ternary max-heap can be represented using an array. What are the indices of the parent and children of a node at index i? Write in pseudocode the shift down algorithm for a ternary max-heap. Let A be the following array
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
