Question

code should be compiled in Linux. Please do not use any STL libraries. Also please provide examples of how to use your code in main(). 1. (30 points) Generalize the Heap data structure from a binary tree to a $k$-ary tree, for an arbitrary $k \ge 2$. Study the relative efficiencies (in terms of actual running time) of the resulting data structure for various values of $k$, by inserting and removing a large number of randomly generated keys into each data structure, which should be included in your main() function. Your main() should also include code for visualizing your heap data structures before and after the operations.

          code should be compiled in Linux. Please do not use any STL libraries. Also please
provide examples of how to use your code in main().
1. (30 points) Generalize the Heap data structure from a binary tree to a $k$-ary tree,
for an arbitrary $k \ge 2$. Study the relative efficiencies (in terms of actual running
time) of the resulting data structure for various values of $k$, by inserting and
removing a large number of randomly generated keys into each data structure,
which should be included in your main() function. Your main() should also include
code for visualizing your heap data structures before and after the operations.

code should be compiled in Linux. Please do not use any STL libraries. Also please
provide examples of how to use your code in main().
1. (30 points) Generalize the Heap data structure from a binary tree to a k-ary tree,
for an arbitrary k ≥ 2. Study the relative efficiencies (in terms of actual running
time) of the resulting data structure for various values of k, by inserting and
removing a large number of randomly generated keys into each data structure,
which should be included in your main() function. Your main() should also include
code for visualizing your heap data structures before and after the operations.

Added by Consuelo D.

Question

Please give Ace some feedback