(Solved) : Data Structure Algorithms Asap Please Answer Completely Answer Answer Correct Thumbs Thank Q28824474 . . .
DATA STRUCTURE AND ALGORITHMS
ASAP. Please answer completely. Answer only if the answer iscorrect for thumbs up! thank you
Consider the following two binomial queues:
Q1: 0101
Q2: 1001
a. (1 point) How many elements are there in each of Q1 andQ2?
b. (1 point) What is the binary representation of the binomialqueue obtained after merging Q1 and Q2?
c. (4 points) Note that a binomial tree of height h is formed bymerging two binomial trees of height h-1. Let C(h,d) be the numberof nodes at a depth d in a tree of height h.
i. (1 point) How much are C(h,0) and C(h,h)?
ii. (3 points) Write down an recurrence for C(h,d) in terms forthe C values for trees of smaller heights.
d. [4 points] What is the time complexity of inserting anelement in a binomial queue in which the height of the tallestbinomial tree is h?
Expert Answer
Answer to Data Structure Algorithms Asap Please Answer Completely Answer Answer Correct Thumbs Thank Q28824474 . . .
OR