1. Does the order in which data is inserted in a heap affect the arrangement of the heap? Use the Heap Workshop applet to find out.
2. Use the Workshop applet's Ins button to insert 10 items in ascending order into an empty heap. If you remove these items with the Rem button, will they come off in the reverse order?
3. Insert some items with equal keys. Then remove them. Can you tell from this whether heapsort is stable? The color of the nodes is the secondary data item.