Question

7. Suppose the same set of 31 values are inserted into two separate initially empty Binary Search Trees (BSTS). What is the maximum possible difference in height between the two trees? Answer 8. Which of the following is the most correct and relevant reason radix sort is not used for all sorting applications even though it can have a faster running time than comparison-based sorts? O Not all sorting applications Involve numerical data Not all sorting applications have bounded key values Not all sorting applications are guaranteed to terminate Not all sorting applications are stable O . As a function of n, how many leaves does the 9. Consider the recurrence (n) - 8T(n/2) + recursion tree have? Answer: leaves child children. 10. A 2-3-4 tree node holding 2 keys will always have - O 02 03 04

Answer 1

Please do understand my concern, as per Chegg guidelines we are supposed to answer the first question if there is more than one question in a post, your downvote effects my career a lot, if I get a downvote for a wrong answer or incomplete answer I will accept it. Please give a positive rating

7) with one set of 31 values we can form a full binary tree where the heigh is 5 and with the other 31 values we can form a skew tree where the height is 31 so the maximum difference is 31-5 = 26