Can somebody solve this? Insert 22, 78, 10, 56, 12, 7, 34, 56 into the Min-...

Question

Question

Can somebody solve this? Insert 22, 78, 10, 56, 12, 7, 34, 56 into the Min- Heap. Also, write the algorithm for Min-Heap.

Answer 1

Answer #1

Algorithm for Min Heap insertion:

Insert a node containing the insertion value in the "fartest left location" of the lowest level of the Binary Tree

Filter the inserted node up using this algorithm:

while ( inserted node's value < value in its parent node )
{
swap the values of the respective node;
}

if you like the answer please provide a thumbs up.

Answer 2

Similar Homework Help Questions

In C# create a linked list with numbers 22, 34, 56, 99, 101. Insert the number...

In C# create a linked list with numbers 22, 34, 56, 99, 101. Insert the number 15 in between 34 and 56.
This question is about the min-heap. A min-heap with 10 elements is given in the following...

This question is about the min-heap. A min-heap with 10 elements is given in the following array format. The following three sub-questions all refer to this min-heap i 1 2 3 4 5 6 7 8 9 10 A[i] 11 22 33 44 55 66 77 88 99 100 Show the result after applying heap-decrease-key(A, 6, 12) to the min-heap at the top of this page: i 1 2 3 4 5 6 7 8 9 10 A[i] Show the...
Insert the keys 7, 6, 2, 13, 4, 6, 5, 12 into a min-heap once a...

Insert the keys 7, 6, 2, 13, 4, 6, 5, 12 into a min-heap once a time, then remove the key in the root repeatedly until the heap is empty. Use diagrams to illustrate each step of the insertion and deletion procedure. What is the time complexity of sorting in this fashion?

4. i) Give the difference between binary trees and Binary search trees. Insert the values 50,...

4. i) Give the difference between binary trees and Binary search trees. Insert the values 50, 76, 21, 4, 32, 64, 15, 52, 14, 100, 2, 3, 70, 87, 80 in the BST [Show the steps]. Write the algorithm for all the 3 operations of BST ii) Insert the given items 16, 14, 10, 8, 7, 9, 3, 2, 4, l into the Min- Heap. [Show the steps]. Write the pseudocode for Insertion of items using the Min- Heap
[Heap] Create a min-binary heap using following numbers (appearing/inserting in the given order): 5, 22, 19,...

[Heap] Create a min-binary heap using following numbers (appearing/inserting in the given order): 5, 22, 19, 56, 50, 25, 1, 3, 10, 6, 32, 12, 11 [Hint: you can put the items in sequence in a binary tree and then use the buildHeap() method.] [Hashing] Consider a hash table where the hash function h is defined as the modulo 10 operation i.e., for any integer k, h(k) = k % 10 (the ‘modulo 10’ operator returns the remainder when k...
2 34 56 7 8 9 10 11 12 13 14 15 Accounts receivable refers to...

2 34 56 7 8 9 10 11 12 13 14 15 Accounts receivable refers to which one of the following? The amount billed for services rendered. The amount due to the organization from patients, third parties, and others. The amount owed to others for services, including suppliers and creditors The amount of actual revenue collected for services rendered.

Can somebody help me solve this? Thank you! Reagents Unknowns pH KOH AgNO, BaCl, NacI NH(a)...

Can somebody help me solve this? Thank you! Reagents Unknowns pH KOH AgNO, BaCl, NacI NH(a) NaS NasO. HSco HCl HNO3 H2SO4 KOH NH3** Na2S NaCl CuCl2 a 10 12 13 14 16 17 18 19 21 23 24 26 28 30 32 35 37 38 39 40 41 42 43 45 46 47 48 49 51 52 53 54 56 57 58 59 61 65 67 68 70 AgNO3 Cu(NO3)2 a Fe(NO3)3 74 75 76 78 80 81 82...
Can somebody please help me solve and understand this problem.. please Just to be clear, bc...

Can somebody please help me solve and understand this problem.. please Just to be clear, bc i know its blurry the numbers are 8 and -8 Thank you so much Write legibly, explain your steps/solutions. Your solutions are limited to this sheet only (fro Question 1 (40pts) Find the DTFT of the following signal, simplify as much as you can. rIn] 6 o- =1 -3 -2-1 01 2 34 s
Here is a set of sample data 6 10 12 13 16 17 18 22 34...

Here is a set of sample data 6 10 12 13 16 17 18 22 34 37 42 45 58 61 80 Identify the 5 number summary (min, Q1, median, Q3, max)

Subject: Algorithm. solve only part 3 and 4 please. 2.2 Selection- 5 points each 1. Run the simultaneous min-and-max algorithm on the array A 4, 2, 12, 6, 13,9,15). (16, 7, 10, 1,5, 11,3,8, 14, 2....

Subject: Algorithm. solve only part 3 and 4 please. 2.2 Selection- 5 points each 1. Run the simultaneous min-and-max algorithm on the array A 4, 2, 12, 6, 13,9,15). (16, 7, 10, 1,5, 11,3,8, 14, 2. Explain why the above algorithm is better than the naive algorithm for finding minimum and maximum separately. How many comparisons does the naive algorithm do? How many comparisons does the simultaneous min and max do? 3. Use the randomized select algorithm based on partition...