Question

Select each statement that is true about BTrees of order m, and height h, containing k keys. In the statements below, we use the phrase "expensive data operations" to denote any kind of remote data transfer required by an algorithm, including things like disk seeks and api calls. All running times are considered to be worst case. (a) h = O(logm k) (b) Searching for a key within a node is an expensive data operation. (c) We can use a B Tree to implement the Dictionary ADT. (d) For a fixed value of k, we can decrease the number of expensive data operations by decreasing m. Select all possible options that apply. @

Answer 1

(a) False

(b) True

(c) True

(d) True

########################################################

Give a ThumbsUp if you found this answer Helpful :)
#######################################################

################################################################
............ Still having trouble understanding the answer ? Feel free to ask in the comment section.......