Question

2. Let B be a k-nary heap. That is, instead of just having two children, as in a binary heap, each node of B has k children. As with binary heaps, though, B we fill B level by level and from left to right. (a) (20 pts) Rewrite the pseudocode for MAX-HEAPIFY, BUILD- MAX-HEAP, and HEAPSORT to handle a k-nary heap (b) (10 pts) What is the complexity of the above three algorithms as a function of k? In other words, as the number of children per node grows, do these operations get more or less expensive? Justify your answer

Answer 1

still if you have any doubt please post a comment below..