6. Create a max heap by adding values in this order: 15, 30, 17, 10, 16....

Question

Question

Answer 1

Answer #1

6) (s,во, 17, 10, 16 Inscet 30: 30 I S 30 30 IS 30 iS 30 20 16 is IS

2 b) (s- u -1

Answer 2

Similar Homework Help Questions

[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...
[12] 3. a) Draw the binary min-heap after inserting the following values, one after another. 21,...

[12] 3. a) Draw the binary min-heap after inserting the following values, one after another. 21, 13, 12, 25, 4, 20, 16, 1, 11 You must show each step of building the heap and eventually the final tree. Please, put your final tree inside a box so that it can be easily understood among other intermediate trees. b) A 4-ary max heap is like a binary max heap, but instead of 2 children, nodes have 4 children. A 4-ary heap...
c++ *construct (draw) a Max Heap when the following keys are inserted in the given order:...

c++ *construct (draw) a Max Heap when the following keys are inserted in the given order: 5, 10, 4, 3, 1, 15, 11, 12, 20, 19, 2 *What is the index of the right child of key 20? *Draw the max Heap after performing removeMax()

Question 3. a. Draw the binary min heap represented by the following array: (5 points) 1...

Question 3. a. Draw the binary min heap represented by the following array: (5 points) 1 2 4 6 7 Value 4 9 12 29 17 14 16 b. Show the result of calling deleteMin twice on the heap you drew in part (a). Show the heap after each deleteMin, and circle the final heap. (5 points) c. Starting with the heap you ended up with in part (b), insert values 11 & 2 in that order. Draw the heap...
Consider the following max-heap stored as an array: <7, 6, 4, 2, 5, 1, 3>. Draw...

Consider the following max-heap stored as an array: <7, 6, 4, 2, 5, 1, 3>. Draw this max-heap as an (undirected) binary tree and give both adjacency-list representation and adjacency-matrix representation of the binary tree
Data structures Exercises: For the following binary tree (Index-Value): 0 1 2 3 4 5 6...

Data structures Exercises: For the following binary tree (Index-Value): 0 1 2 3 4 5 6 7 8 9 A C E G B P D X F H Give the pre-order traversal. Give the post-order traversal. Give the in-order traversal. Determine the height of the tree. Using these values: 8 6 4 3 5 9 2 1 6 Build a binary search tree. Build an AVL Tree. Build a 2-3 Tree. Build a min-heap. Build a max-heap. Apply a...

1.(10 pts) Contrast a heap with a binary search tree by inserting the numbers 60, 30,...

1.(10 pts) Contrast a heap with a binary search tree by inserting the numbers 60, 30, 40, 50, 20, 10 first in a BST and then in a min-heap. Draw the resulting BST on the left and the heap on the right. You may draw any valid BST or Heap that contain the provided values 2. (5 pts) In section 11.1, the book mentions that heaps are **complete** binary trees, what does that mean? Demonstrate by drawing an example of...
5. Heap, 5pts] The following elements are inserted into an empty Max-Heap in the fol- la-FHea...

5. Heap, 5pts] The following elements are inserted into an empty Max-Heap in the fol- la-FHea lowing order: 2, 3. 1, 4, 6. 12, 15, 22, 11, 5 Draw the resulting heap (use the logical (tree) representation)
Tree & Hash Table & Heap Use the following integer keys 73, 58, 91, 42, 60,...

Tree & Hash Table & Heap Use the following integer keys 73, 58, 91, 42, 60, 130, 64, 87 to perform the followings: a) Binary Search Tree - Draw a binary search tree - Retrieve the integers keys in post-order - Retrieve the integers keys in pre-order - Draw a binary search tree after node 58 is deleted b) Create a Hash Table using the methods described below. Show the final array after all integer keys are inserted. Assumes that...

For a set of {1, 5, 6, 4, 16, 17, 10}of keys, draw binary trees of...

For a set of {1, 5, 6, 4, 16, 17, 10}of keys, draw binary trees of heights 2, 3, 4, 5, and 6.