Thenbsp2-d heapnbspis a data structure that allows each, Ask an Expert

Engineering

The 2-d heap is a data structure that allows each item to have two individual keys. deleteMin can be performed with respect to either of these keys. The 2-d heap is a complete binary tree with the following order property: For any node X at even depth, the item stored at X has the smallest key #1 in its subtree, while for any node X at odd depth, the item stored at X has the smallest key #2 in its subtree.

a. Draw a possible 2-d heap for the items (1,10), (2,9), (3,8), (4,7), (5,6).

b. How do we ?nd the item with minimum key #1?

c. How do we ?nd the item with minimum key #2?

d. Give an algorithm to insert a new item into the 2-d heap.

e. Give an algorithm to perform deleteMin with respect to either key.

f. Give an algorithm to perform buildHeap in linear time.

View complete question

Computer Engineering, Engineering

Category:- Computer Engineering
Reference No.:- M91643322

Have any Question?Write your Review or question?

Related Questions in Computer Engineering

You are evaluating two different silicon wafer milling

You are evaluating two different silicon wafer milling machines. The Techron I costs $255,000, has a three-year life, and has pretax operating costs of $68,000 per year. The Techron II costs $445,000, has a five-year lif ...

A sequence of natural numbers a1 a2 an is said to be a

A sequence of natural numbers (a 1 , a 2 , ..., a n ) is said to be a degree sequence if there exists an undirected graph on n vertices {v 1 , v 2 , ..., v n } such that the degree of v i is a i for each i = 1, 2, ..., ...

Question questions 1 - 3 are related to singly linked list

Question: Questions 1 - 3 are related to "singly linked list". You must type your answer. 1. What are the fundamental operations of a linked list? 2. What is the main advantage of a linked list over an array? 3. What is ...

Respond to the followingin a bst what is the complexity

Respond to the following: In a BST, what is the complexity required to remove the minimum element? In a BST, what is the complexity required to find (but not remove) the minimum element? In a heap, what is the complexity ...

Lets do some r suppose you have the following situation you

Let's do some R.... Suppose you have the following situation: You have a large jar of beans, 43% black, 57% white. You take a sample of 14 beans. a) Use R to figure out the probability for every single possible outcome. ...

Question hypothetically speaking you are assigned to a

Question: Hypothetically speaking, you are assigned to a committee of three to decide on a dress code for Campbellsville University Staff and Faculty. Only two of the three votes are required to pass this policy. In this ...

Question a suppose you do shading calculations in the

Question : a) Suppose you do shading calculations in the vertex shader. What happens to the vertex colors when they go from the vertex shader to the fragmant shader? b) Suppose instead you want to do the shading calculat ...

Ethics and the information security professionnbspwhat are

ETHICS AND THE INFORMATION SECURITY PROFESSION What are the ethical dilemmas and challenges faced by information security professionals? Are professional organizations' ethical codes of conduct beneficial as an informat ...

Question develop a taxonomy of dsia document a taxonomy is

Question: Develop a "taxonomy" of DS/IA document. A taxonomy is a way of organizing something on a "group within group" basis. (Remember how the biological taxonomy is structured.) Initially, define data security and inf ...

Question a suppose that a particular algorithm has time

Question : a) Suppose that a particular algorithm has time complexity T(n) = 3 x 2 n , and that executing an implementation of it on a particular machine takes t seconds for n inputs. Now suppose that we are presented wi ...

4,153,160 Questions Asked
13,132 Experts
2,558,936 Questions Answered

Ask Experts for help!!

Looking for Assignment Help?

Start excelling in your Courses, Get help with Assignment

Write us your full requirement for evaluation and you will receive response within 20 minutes turnaround time.

Ask Now Help with Problems, Get a Best Answer

Recent Questions

Ask Computer Engineering Expert