In Heapsort, we assume that arrays are indexed from 1 to n. For example, if A = [16,4,10,14,7,9,3,2,8,1], then A[2] = 4 (highlighted in red). %3D The MAX-HEAPIFY(A, i) procedure inputs an array A and an index i. It assumes that the binary trees rooted at LEFT(i) and RIGHT(i) are max heaps, and ensures that A[i] "floats down" so that the output is an array that obeys the max-heap property. An example is provided on pg. 155 of the textbook. In this example, A = [16,4,10,14,7,9,3,2,8,1]. Then MAX-HEAPIFY(A, 2) %3D corrects the 2nd element of A, which is 4, moving this number to the correct position. The output is [16,14,10,8,7,9,3,2,4,1]. Let A = [2,11,10,9,6,7,8,3,5,4,1]. Determine MAX-HEAPIFY(A,1).

In Heapsort, we assume that arrays are indexed from 1 to n. For example, if A = [16,4,10,14,7,9,3,2,8,1], then A[2] = 4 (highlighted in red). %3D The MAX-HEAPIFY(A, i) procedure inputs an array A and an index i. It assumes that the binary trees rooted at LEFT(i) and RIGHT(i) are max heaps, and ensures that A[i] "floats down" so that the output is an array that obeys the max-heap property. An example is provided on pg. 155 of the textbook. In this example, A = [16,4,10,14,7,9,3,2,8,1]. Then MAX-HEAPIFY(A, 2) %3D corrects the 2nd element of A, which is 4, moving this number to the correct position. The output is [16,14,10,8,7,9,3,2,4,1]. Let A = [2,11,10,9,6,7,8,3,5,4,1]. Determine MAX-HEAPIFY(A,1).

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

Code it. The mergeTwoLists function in my code comes from the problem Merge Two Sorted Listswhose complexity obviously is O(n), n is the sum of length of l1 and l2. To put it simpler, assume the k is 2^x, So the progress of combination is like a full binary tree,from bottom to top. So on every level of tree, the combination complexity is n,because every level have all n numbers without repetition.The level of tree is x, ie log k. So the complexity is O(n log k). for example, 8 ListNode, and the length of every ListNode is x1, x2,x3, x4, x5, x6, x7, x8, total is n. on level 3: x1+x2, x3+x4, x5+x6, x7+x8 sum: n on level 2: x1+x2+x3+x4, x5+x6+x7+x8 sum: n on level 1: x1+x2+x3+x4+x5+x6+x7+x8 sum: n.
Please code it. The mergeTwoLists function in my code comes from the problem Merge Two Sorted Listswhose complexity obviously is O(n), n is the sum of length of l1 and l2. To put it simpler, assume the k is 2^x, So the progress of combination is like a full binary tree,from bottom to top. So on every level of tree, the combination complexity is n,because every level have all n numbers without repetition.The level of tree is x, ie log k. So the complexity is O(n log k). for example, 8 ListNode, and the length of every ListNode is x1, x2,x3, x4, x5, x6, x7, x8, total is n. on level 3: x1+x2, x3+x4, x5+x6, x7+x8 sum: n on level 2: x1+x2+x3+x4, x5+x6+x7+x8 sum: n on level 1: x1+x2+x3+x4+x5+x6+x7+x8 sum: n.
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.
Given an array nums that represents a permutation of integers from 1 to n. We are going to construct a binary search tree (BST) by inserting the elements of nums in order into an initially empty BST. Find the number of different ways to reorder nums so that the constructed BST is identical to that formed from the original array nums.For example, given nums = [2,1,3], we will have 2 as the root, 1 as a left child, and 3 as a right child. The array [2,3,1] also yields the same BST but [3,2,1] yields a different BST.Return the number of ways to reorder nums such that the BST formed is identical to the original BST formed from nums.Input: nums = [3,4,5,1,2]Output: 5[3,1,2,4,5][3,1,4,2,5][3,1,4,5,2][3,4,1,2,5][3,4,1,5,2] Note: Solve using concepts of data structures
For the given complete binary tree (given in an array): 1 2 3 4 5 6 7 8 9 10 11 J B K A O T U X R Q D Convert it into a max heap and provide your answer by dragging and dropping the given alphabets on correct positions in array.
Implement a priority queue using a heapordered binary tree, but use a triply linked structure instead of an array. You will needthree links per node: two to traverse down the tree and one to traverse up the tree. Yourimplementation should guarantee logarithmic running time per operation, even if nomaximum priority-queue size is known ahead of time.
Let's assume that a binary heap is represented using a binary tree such that each node may have a left child node and a right child node. For this type of representation, we can still label the nodes of the tree in the same way as we label the nodes for an array representation. That is, the root node has a label 1. In general, for a node with label i, its left child node will have a label 2i and the right child has a label 2i+1. For any i with 1 <= I <= n , Terry says that the following easy algorithm will walk you from the root node to the node with label i: First find the binary representation P of i. Start with the rightmost bit (least significant bit) of P, walk down from the root as follow: For a 0 bit, walk to the left child, for a 1 bit walk to the right child. At the end, you’ll reach the node with label i. Which of the following is the most appropriate? A. Terry’s algorithm is wrong and not fixable. B. Terry’s algorithm is right. C. Terry's algorithm can be…
: A binary search tree was created by traversing through an array from left to rightand inserting each element. Given a binary search tree with distinct elements, print all possiblearrays that could have led to this tree.EXAMPLEInput: 1<-2->3Output: {2, 1, 3}, {2, 3, 1}
Using Java code Do the given, Using the Necessary conditions, Recover the Binary Search tree (T) from the given Post order Traversal. Example: Input: 5, 18, 15, 25, 20, 35, 45, 60, 50, 40, 30 Output: 30, 20, 40, 15, 25, 35, 50, 5, 18, 45, 60
Consider the problem of determining the smallest element in a maxheap. The smallest elements of a max heap must be one of the n/2 leaves. (Otherwise,there must be a nonleaf that is smaller than one of its descendants, which means thetree is not a max heap.) Thus, it is sufficient to search all leaves. Prove a lower boundthat searching all the leaves is necessary
Given a max-priority queue A = <8, 5, 7, 3, 2, 4, 1>, consider calling Max-Heap-Insert(A, 6). Note: Array index starts from 1. (1) What will be the resulting max-priority queue A? Please write your answer as a sequence of numbers separated by ", ". For example: 1, 2, 3, 4, 5, 6, 7, 8
Problem 1: 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.