To find the minimum element stored in a heap
A) you should start at the root, and then keep passing from each node to its left child until you come to a node with no left child
B) you should start at the root, and then keep passing from each node to its right child until you come to a node with no right child
C) you should look at the root of the binary tree
D) you need to examine every node, and then pick the one with the least value
C) you should look at the root of the binary tree
You might also like to view...
When a report is the current Access object, the Property Sheet button is found in the ________ group on the Design tab
A) Controls B) Grouping & Totals C) Themes D) Tools
________ Preview is a technology that shows the result of applying an editing or formatting change as you point to possible results—before you actually apply the change
Fill in the blank(s) with correct word