In the B-tree ADT internal insert function, if we are not at a leaf, we search the node for the entry that contains the target. If the entry is 0, the subtree may be either the node's first pointer's subtree or ____.

A. the entry's right subtree
B. the entry's left subtree
C. the whole tree (we are at the root)
D. null

Answer: B

Computer Science & Information Technology

You might also like to view...

An element is a ___________

A. single variable in an array. B. collection of related variables. C. an array that requires two or more subscripts to reference a single array D. a non-negative integer used to identify an element in an array

Computer Science & Information Technology

Once an organization has estimated the worth of various assets, what three questions must be asked to calculate the potential loss from the successful exploitation of a vulnerability?

What will be an ideal response?

Computer Science & Information Technology