subject

Problem 2: heaps.

min-heap: construct a min_heap from the following set of integers. remember to use successive adds to arrive at your final heap. (you do not need to show all the intermediate steps, however, showing those can in case you make an error somewhere down the line.)

1, 19, 7, 5, 6, 42, 21, 13, 56, 78, 29, 3, 14

remove_min: show the result of two successive remove_min operations on the heap formed in part a.
perform the following operations on the min_heap: add(45)

as you must have noticed the set of integers provided to both the bst and heap problems were the same. however, the structures formed are vastly different. what can you say about the relative heights (and therefore the worst-case cost of operations) of the bst as compared to the heap? what conclusions are you able to draw regarding the relative efficiency of the 2 data structures? (remember that log213 = 3.7)

ansver
Answers: 2

Another question on Computers and Technology

question
Computers and Technology, 22.06.2019 23:50
List a few alternative options and input and output over the standerd keyboard and monitor. explain their functioning in details.
Answers: 2
question
Computers and Technology, 23.06.2019 16:50
15: 28read the summary of "an indian's view of indian affairs."15 betterin "an indian's view of indian affairs," it is asserted that conflicts could be reduced if white americansunderstood native americans..pswhich of the following would make this summary more complete? eleo the fact that chief joseph believes the great spirit sees everythinthe fact that chief joseph was born in oregon and is thirty-eight years oldo the fact that chief joseph states that he speaks from the hearthehehethe fact that chief joseph of the nez percé tribe made this claimebell- ==feetle===-felsefe ==submitmark this and retum.=
Answers: 3
question
Computers and Technology, 25.06.2019 04:00
Has anyone noticed that has been giving the wrong answers and that the ads are blocking answers or is that just me?
Answers: 2
question
Computers and Technology, 25.06.2019 05:00
7. the cullerton park district holds a mini-olympics each summer. create a class named participant with fields for a name, age, and street address. include a constructor that assigns parameter values to each field and a tostring() method that returns a string containing all the values. also include an equals() method that determines two participants are equal if they have the same values in all three fields. create an application with two arrays of at least eight participants each—one holds participants in the mini-marathon, and the other holds participants in the diving competition. prompt the user for participant values. after the data values are entered, display values for participants who are in both events. save the files as participant.java and twoeventparticipants.java.
Answers: 2
You know the right answer?
Problem 2: heaps.

min-heap: construct a min_heap from the following set of integers. r...
Questions
question
Mathematics, 03.12.2020 18:40
question
Mathematics, 03.12.2020 18:40
question
Mathematics, 03.12.2020 18:40
Questions on the website: 13722360