Recent questions tagged goclasses-da-dpp-day-229

Which formula is the best approximation for the depth of a heap with $n$ nodes?$\log_2 n$ The number of digits in $n$ in base $10$ $\sqrt n$ $n^2$

A priority queue is implemented using a max-heap. During reheapification downward, the out-of-place node has priority $42$.The surrounding priorities are:Parent priority:...

What feature of heaps allows them to be efficiently implemented using a partially filled array?Heaps are binary search trees Heaps are complete binary trees Heaps are ful...

A binary heap is stored in an array using $\textbf{1}$-based indexing. If a node is stored at location $i$ and it has two children, where is its left child stored?$\left\...

Which of the following trees are valid binary min-heaps?