What is the index of the right child of a node at index i in an Array representation of a Max heap? Assume the cell at index 0 is empty.单项选择题

A

a. i/2

B

b. 2i + 1

C

c. 2i

D

d. i-1

登录即可查看完整答案

我们收录了全球超50000道真实原题与详细解析,现在登录,立即获得答案。

类似问题

In a min-heap of n elements, implemented with a complete binary tree, the worst case time cost for removeMin() is

Heap Algo 4 You are using the HeapPriorityQueue class implemented with a binary min-heap, which is stored as an array (Python list) in level-order. The heap currently stores the following key-value pairs: [(2, 'A'), (4, 'B'), (6, 'C'), (8, 'D'), (5, 'E')] After calling remove_min() once, what will be the contents of the heap (in array/list format)? (Assume that the heap properties are restored correctly after the operation.) Pseudocode for remove_min() remove_min(): swap the root with the last element remove the last element (which is the min) call _downheap(0) Pseudocode for _downheap(j) _downheap(j): if left child exists: small_child = left if right child exists and right < left: small_child = right if small_child < j: swap(j, small_child) _downheap(small_child) In this implementation, for an element at index j: Left child is at index 2j + 1 Right child is at index 2j + 2 Parent is at index (j - 1) // 2

A max‑heap is always a:

How many children can a node in a binary heap have?

更多留学生实用工具

加入我们，立即解锁 海量真题 与 独家解析，让复习快人一步！