1.Assume that an n-node Fibonacci heap is obtained after performing thebasic mergeable heap operations (thatINSERT, UNION, EXTRACT MIN). Estimate theis, MAKE HEAP, MIN,a) number of trees (from below and from above),b) size of a subtree rooted at a node of degree k> 0, andc) maximum degree of a nodein the resulting heap.

Compare the roots of two heaps. Push the smaller key into an empty stack, and move to the right…

Assume that an n-node Fibonacci heap is obtained after performing the basic mergeable heap operations (that is, MAKE_HEAP, MIN, INSERT, UNION, EXTRACT MIN). Estimate the a) number of trees (from below and from above), b) size of a subtree rooted at a node of degree k > 0, and c) maximum degree of a node in the resulting heap.

Assume that an n-node Fibonacci heap is obtained after performing the basic mergeable heap operations (that is, MAKE_HEAP, MIN, INSERT, UNION, EXTRACT MIN). Estimate the a) number of trees (from below and from above), b) size of a subtree rooted at a node of degree k > 0, and c) maximum degree of a node in the resulting heap.

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

Give new solution only
check the image for question
The Heapify Problem: make algorithm for Heapify(r ) pre-cond: The balanced binary tree rooted at A[r ] is such that its left and right subtrees are heaps. post-cond: Its values are rearranged in place to make it complete heap.
You are given a list of numbers for which you need to construct a min-heap. (A min-heap is a complete binary tree in which every key is less than or equal to the keys in its children.) How would you use an algorithm for constructing a max-heap (a heap as defined in Section 6.4) to construct a min-heap? You need to describe your algorithm in pseudo code.
Please help me write a pyhon code for this problem
Write algorithm Heapify(r ) pre-cond: The balanced binary tree rooted at A[r ] is such that its leftand right subtrees are heaps. post-cond: Its values are rearranged in place to make it completeheap.
2
True or False: 1. In a mini binary heap, each parent must be >= to its children 2. General Trees which have 3 sub trees per node are called ternary trees 3. A set of disjoint trees or forest is obtained by deleting the root and the edges connecting the root node to nodes at level 1
please do solve both of them. it will be much helpful for me. Thank you.
Assume the complete binary tree numbering scheme used by Heapsort and apply the Heapsort algorithm to the following key sequence (3,25,9, 35,10,13,1,7,46). The first element index is equal 0. a. What value is in location 5 of the initial HEAP? b. After a single deletion (of the element at the heap root) and tree restructuring, what value is in location 5 of the new HEAP?
Given the following list of integers: 12,15,20,25 (a) Apply the BUILDHEAP procedure to this list, in a right-to-left scan. Draw appropriate trees each time the addition of a new element causes changes in the tree structure. (b) Now, sort the list obtained in part(a) in a series of exchange and heapify steps. Once again, draw appropriate trees to illustrate each exchange-heapify step.
What are the steps involved in SET Transaction?