Q.No.3 a) Which array out of A, B and C represents a 0 1 2 9 10 11 binary heap? Only one answer is right. A-1 12 23 10 15 | 38 45 15 18| 20|21 0 1 2 3 4 5 7 8 9 10 11 b) Write the heap out as a binary tree. B= 18 27 10 45 | 83 91 31 12 52 51 c) Add last 2 digit of your arid no(44). to the 0 1 2 3 4 7 8 9 10 11 heap, making sure to restore the heap C=|1 13 20 21| 65 54 67 41 30 83 52 invariant. How does the array look now?

Q.No.3 a) Which array out of A, B and C represents a 0 1 2 9 10 11 binary heap? Only one answer is right. A-1 12 23 10 15 | 38 45 15 18| 20|21 0 1 2 3 4 5 7 8 9 10 11 b) Write the heap out as a binary tree. B= 18 27 10 45 | 83 91 31 12 52 51 c) Add last 2 digit of your arid no(44). to the 0 1 2 3 4 7 8 9 10 11 heap, making sure to restore the heap C=|1 13 20 21| 65 54 67 41 30 83 52 invariant. How does the array look now?

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 procedure meld that takes two heap-ordered Bk trees, and produces a heap-ordered Bk+1 tree: > (meld 3 5) ’(5 3) > (meld ’(4 (2 1) 3) ’(14 (12 11) 13)) ’(14 (4 (2 1) 3) (12 11) 13) > (meld ’(18 (14 (12 11) 13) (16 15) 17) ’(8 (4 (2 1) 3) (6 5) 7)) ’(18 (8 (4 (2 1) 3) (6 5) 7) (14 (12 11) 13) (16 15) 17) Notice that the arguments of meld may be both integers, or both lists with the same structure. These two arguments each code Bk trees (for some fixed k—above, we have examples for k = 0, 2, 3). Your coding of meld should be constant time: the number of cons, car, cdr, null? operations should not be proportional to the size of the input trees.
Place the following sequence of elements in an empty binary search tree (BST): 26, 44, 63, 83,17, 19, 8, 41, 37, 21, 14, 5, 13, 16. Below are a number of questions about the resulting binary search tree. Indicate which statement (s) are correct. A. The leaves of the tree contain elements 5, 13, 16, 21, 37 and 83. B. The leaves of the tree contain elements 5, 13, 16, 19, 37 and 83. C. The tree has a height of 3. D. A BST containing 14 elements has a height of at least 3 and at most 13. Group of answer options Only statements B and D are correct. Only statements B, C and D are correct. Only statement D is correct. Only statements A, C and D are correct. Only statements A and D are correct.
Please answer the following, #6 (in bold) . Number 5 is linked to #6, but i only need number 6 NOT 5. Write clearly please. 5. Create a height-balanced binary search tree from the following sorted array. 1 5 9 11 12 13 15 18 19 6. Consider from the previous questions the height balanced binary search trees created from sorted arrays. Creating this balanced tree gives a tree with an efficient search time for any value it holds. If I wanted to find the range of the data (difference between largest and smallest item), how long would it take to do this with the binary search tree? Explain your answer with a single sentence. (Give the answer relative to input size n, but not in Big O notation).
8_ I need completion of code. Given a binary tree, check whether it is a mirror ofitself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ / \3 4 4 3But the following [1,2,2,null,3,null,3] is not: 1 / \ 2 2 \ \ 3 3Note:Bonus points if you could solve it both recursively and iteratively.""" # TC: O(b) SC: O(log n)def is_symmetric(root): if root is None: return True return helper(root.left, root.right) def helper(p, q): if p is None and q is None: return True if p is not None or q is not None or q.val != p.val: return False return helper(p.left, q.right) and helper(p.right, q.left) def is_symmetric_iterative(root): if root is None: return True stack = [[root.left, root.right]] while stack: left, right = stack.pop() # popleft if left is None and right is None: continue. .
Heapsort We will call heapsort on the array of size 11 with values 0, 2, 7, 6, 8, 3, 1, 4, 7, 10, 9 a) In Phase 1: Draw the INITIAL TREE and redraw the tree AFTER EACH CALL TO FIXHEAP. That means you will draw a total of six trees. b) In Phase 2: Draw the tree after the first swap, the first call to fixeheap, the second swap and the second call to fixheap. The means you'll draw a total of four trees. After the first swap omit the last array value from the tree. After the second swap, omit both the second to last and last array values from the tree. For the purposes of grading please draw neat, easy-to-read diagrams.
8. Given a sequence of numbers: 19, 6, 8, 11, 4, 5(I) Draw a binary min-heap (in a tree form) by inserting the above numbers readingthem from left to right. (II) Show a tree that can be the result after the call to deleteMin() on the above heap.(III) Show a tree after another call to deleteMin().
Please Draw the Max Heap and the Min Heap for the following list: 6, 45, 32, 98, 55, and 69, Does the tree change if the input order changes for min and max heap? PLEASE HELP
Q.No.3 Which array out of A, B and C represents a binary heap? Only one answer is right. Write the heap out as a binary tree. Add last 2 digit of your Roll no suppose your roll no is(47). to the heap, making sure to restore the heap invariant. How does the array look now?
Need help with this java programming homework Please Example C 9.37 Suppose two binary trees, T1 and T2, hold entries satisfying the heap-order prop- erty (but not necessarily the complete binary tree property). Describe a method for combining T1 and T2 into a binary tree T, whose nodes hold the union of the entries in T1 and T2 and also satisfy the heap-order property. Your algorithm should run in time O(h1 + h2) where h1 and h2 are the respective heights of T1 and T2.
Extend program BinarySearchTree.java by adding the following operations to the BinarySearchTree class: Show the results. a. Find the height of the BST. b. Find node with the largest key. c. Find the average of the key values of the nodes. d. Print the nodes in the tree in pre-order, in-order, and post-order. (decided by the user after run) e. Create the same BST shown in question 2. Run your program for the BST shown in question 1 to its final state and output the height, the largest key, and average of the keys. import java.util.*; public class BinarySearchTree1{ public Node root; public BinarySearchTree1() { root = null; } public Node getroot() { return root; } public Node Search(int KEY) { Node x = root; while (x != null && x.item != KEY) { if (KEY < x.item) { x = x.Left; } else {…
Extend program BinarySearchTree.java by adding the following operations to the BinarySearchTree class: a. Find the height of the BST. b. Find node with the largest key. c. Find the average of the key values of the nodes. d. Print the nodes in the tree in pre-order, in-order, and post-order. (decided by the user after run) e. Create the same BST shown in question 2. Run your program for the BST shown in question 1 to its final state and output the height, the largest key, and average of the keys. import java.util.*; public class BinarySearchTree1{ public Node root; public BinarySearchTree1() { root = null; } public Node getroot() { return root; } public Node Search(int KEY) { Node x = root; while (x != null && x.item != KEY) { if (KEY < x.item) { x = x.Left; } else { x =…
Create a Max Heap tree given the following input values. 19, 7, 10, 55, 3, 42, 100, 8