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...
MC The control value of a for structure that iterates a sequence represents the______of each element.
a) value. b) subscript. c) location in memory. d) None of the above.
Computer Science & Information Technology
Each time a method is invoked, the system stores parameters and local variables in an area of memory, known as _______, which stores elements in last-in first-out fashion.
a. a heap b. storage area c. a stack d. an array
Computer Science & Information Technology
The _____ function calculates the difference between two dates and shows the result in months, days, or years.
A. nested IF B. CALIF C. DATEDIF D. DATE
Computer Science & Information Technology
A file is a collection of related ____.
A. characters B. fields C. tables D. records
Computer Science & Information Technology