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...
Which of the following states the Rule of Entity Integrity?
a. Every row must have a value for the primary key and each value must be unique. b. Every foreign key must appear as another table’s primary key. c. Every row must have a value for the primary key and values may be repeated. d. None of the above.
The digital signature approach uses an algorithm that is designed to provide only the _________ function.
A. digital signature B. ElGamal C. DSA D. timestamp
en_US and de_DE are examples of:
a. locale identifiers b. string identifiers c. translation identifiers d. externalization identifiers
The ____________________ is a small program stored on the Master Boot Record (MBR) that can load one or more OSs by reading file system information through a pointer from the disk partition containing OS files.
Fill in the blank(s) with the appropriate word(s).