Problem 16. In an array-based implementation of a Heap Part B: the left child of the right child of the node at index i,
Posted: Fri May 20, 2022 5:56 pm
Problem 16.
In an array-based implementation of a Heap
Part B: the left child of the right child of the node at index
i, if it exists, can be found at what array location?
Why?
In an array-based implementation of a Heap
Part B: the left child of the right child of the node at index
i, if it exists, can be found at what array location?
Why?