Question 5 If we build the Max-Heap tree of the following set of data: [10, 2, 6, 7, 18, 0, -3, 5] Which of the following statements are not true? 3 is the root node and 10 and and 18 are among the leave nodes. O 18 is the root node and 2 and and -3 are among the leave nodes. 18 is the root node and 7 and and -3 are among the leave nodes. O 18 is the root node and 7 and and 10 are among the leave nodes.

Question 5 If we build the Max-Heap tree of the following set of data: [10, 2, 6, 7, 18, 0, -3, 5] Which of the following statements are not true? 3 is the root node and 10 and and 18 are among the leave nodes. O 18 is the root node and 2 and and -3 are among the leave nodes. 18 is the root node and 7 and and -3 are among the leave nodes. O 18 is the root node and 7 and and 10 are among the leave nodes.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

a) Create a min-heap tree for the following numbers. The numbers are read in sequence from left to right. 14, 7, 12, 18, 9, 25, 14, 6 b) How would the above heap tree be changed when we remove the minimum?
1.Let us consider a priority queue of size 10 containing the data {“introspective”, “intelligent”, “intellectual”, “intimate”, “intensive”, “interesting”, “internal”, “into”, “in”, “intro”}. Attempt the following questions:a. Which attribute of the strings is used to determine their priority in the priority queue?b. What type of binary heap is used to implement this priority queue (max or min)?c. Show how this priority queue is affected if one item is dequeued.
Question 16 Rk.Given a max-heap whose values correspond to the array indices from 1 through n,what is the smallest possible index for a node with height 1 in the heap? Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line
you are given 262 items that need to be inserted into a binary heap. a) What is the height of the tree that represents the heap when all the items have been inserted? b) How many additional items can be inserted without increasing the height of the tree that represents the heap? please explain in detail.
Problem1: Use the procedure MAX-HEAPIFY in a bottom-up manner to convert the arrayA = <1, 7, 6, 8, 0, 5, 2, 12, 3, 18> to build a max heap Problem 2:Insert the following set of keys {1, 7, 6, 8, 0, 5, 2, 12, 3, 18} in an empty binary search tree in the order they are listed.
2. Show the results of the following operations on an initially empty max heap: a. insert 2, 3, 4, 1, 9, one item at a time; b. delete one item from the heap; c. insert the item 7 and then the item 6; d. delete one item from the heap e. insert the item 5. [7] 3. Show the array presentation of tree that resulted from Question 2.
1. a Is this a min-heap or a max-heap?b. What is the value of the root node?c. What is the left child of node 14?d. What is the left child of node 26?
.1. Draw the binary min-heap tree that results from inserting 65, 12, 73, 36, 30, 55, 24, 92 in that order into an initially empty binary min heap. BOX IN YOUR FINAL BINARY MIN HEAP. .2. Using the final binary min-heap above, show the result of performing a dequeue( ) operation, assuming a priority queue is implemented using a binary min-heap. BOX IN YOUR FINAL BINARY MIN HEAP.
A min-heap is useful when we are interested in the minimum value of aset of numbers. Now, instead of the min, we are interested in the K-th smallest value. a.) ) Please design a data structure to allow the following two operations: push (insert a newnumber) and find_Kmin (return the value of the K-th smallest number without removing it). Bothoperations should be done in O(log K) time. b.) In addition to push and find_Kmin, now we also want to support the pop operation toreturn and remove the K-th smallest element. Please design a data structure to support these threeoperations, and each operation should take O(log n) time with n being the size of the current set.
Circle the following statement that is false regarding binary heaps.a. Binary heaps are not always complete binary trees.b. Binary heaps can be used for sorting in O(n log n) time.c. Binary heaps can be reheapified after a pop in worst case O(log n) time.
Direction: Given the following values, construct the max heap binary tree, then write the pre-order and post-order traversal values. 80, 65, 50, 40, 38, 44, 42, 30, 25
You are given 262 items that need to be inserted into a binary heap. a) What is the height of the tree that represents the heap when all the items have been inserted? b) How many additional items can be inserted without increasing the height of the tree that represents the heap?You must explain both your answers in your own words.