Given the following list of integers: 12,15,20,25 (a) Apply the BUILDHEAP procedure to this list, in a right-to-left scan. Draw appropriate trees each time the addition of a new element causes changes in the tree structure. (b) Now, sort the list obtained in part(a) in a series of exchange and heapify steps. Once again, draw appropriate trees to illustrate each exchange-heapify step.

Given the following list of integers: 12,15,20,25 (a) Apply the BUILDHEAP procedure to this list, in a right-to-left scan. Draw appropriate trees each time the addition of a new element causes changes in the tree structure. (b) Now, sort the list obtained in part(a) in a series of exchange and heapify steps. Once again, draw appropriate trees to illustrate each exchange-heapify step.

Similar questions

2. This question is about binary search tree.a. Show the final result after inserting 3, 1, 4, 6, 9, 2, 8, 5, 7, 0 into an empty binary search tree.b. Show the result of deleting the root twice. If the deleted node contains 2 children, its value is replaced by the minimum value of the right subtree, and the deletion is propagated. Show the result after each deletion
Please show steps clearly
Question 8 Please explain your answers
Please don't use handwritting Six integers are given in this order: 8, 4, 3, 5, 9, and 6. Do each of the following. SHOW YOUR WORK step by step.1. Create an AVL tree by inserting the integers in the given order.2. Create a (2,3) tree to store these data.3. Create the max-heap using the bottom-up approach. You need to provide both tree and arrayrepresentations for the heap.
If a Stack is most optimally derived from a Singly Linked List, which node of the Linked List should be pointed to or will be referred to as the Top of the stack and why?
Please written by computer source