subject
Engineering, 06.04.2020 21:52 dennisedemirovic20

For this question, we will use the heap-supporting functions as seen in the lecture slides as building blocks for this assignment to build a new heap implementation. The heap implementation shown in the lecture slides is an example of a min-heap, in which the smallest element is at the root and an elements in child trees are larger than the value at the root. We can also construct max heap data structures in which the largest element in the heap is at the root and all elements in child trees are smaller than the root

The objective is to define SCHEME functions to manipulate a heap which
1. maintain a binary tree as a heap,
2. use a generic (first order) order relation
3. provides functions which can determine if a heap is empty as well as heap. insert heap-renove and combine-heaps

Define a SCHEME function, named (heap-remove f H) which takes two arguments, a heap and a firstorder relation, a heap containing the elements of H with the root value removed. Note, heap-remove

ansver
Answers: 3

Another question on Engineering

question
Engineering, 04.07.2019 18:10
The mass flow rate of the fluid remains constant in all steady flow process. a)- true b)- false
Answers: 1
question
Engineering, 04.07.2019 18:10
The temperature of air decreases as it is compressed by an adiabatic compressor. a)- true b)- false
Answers: 2
question
Engineering, 04.07.2019 18:10
If a particle moves along a path such that r : (3 sin t) m and ? : 2t rad, where t is in seconds. what is the particle's acceleration in m/s in 4 seconds? a)- 16.43 b)- 16.29 c)- 15.21 d)- 13.79
Answers: 1
question
Engineering, 04.07.2019 18:10
Fluids at rest possess no flow energy. a)- true b)- false
Answers: 3
You know the right answer?
For this question, we will use the heap-supporting functions as seen in the lecture slides as buildi...
Questions
question
Mathematics, 09.01.2021 01:00
Questions on the website: 13722365