- 6.6.1: Can both insert and findMin be implemented in constant time?
- 6.6.2: a. Show the result of inserting 10, 12, 1, 14, 6, 5, 8, 15, 3, 9, 7...
- 6.6.3: 3 Show the result of performing three deleteMin operations in the h...
- 6.6.4: A complete binary tree of N elements uses array positions 1 to N. S...
- 6.6.5: Rewrite the BinaryHeap insert method by placing a reference to the ...
- 6.6.6: How many nodes are in the large heap in Figure 6.13?
- 6.6.7: a. Prove that for binary heaps, buildHeap does at most 2N2 comparis...
- 6.6.8: Show the following regarding the maximum item in the heap:a. It mus...
- 6.6.9: Show that the expected depth of the kth smallest element in a large...
- 6.6.10: a. Give an algorithm to find all nodes less than some value, X, in ...
- 6.6.11: 1 Propose an algorithm to insert M nodes into a binary heap on N el...
- 6.6.12: Write a program to take N elements and do the following:a. Insert t...
- 6.6.13: Each deleteMin operation uses 2 logN comparisons in the worst case....
- 6.6.14: If a d-heap is stored as an array, for an entry located in position...
- 6.6.15: Suppose we need to perform M percolateUps and N deleteMins on a d-h...
- 6.6.16: Suppose that binary heaps are represented using explicit links. Giv...
- 6.6.17: Suppose that binary heaps are represented using explicit links. Con...
- 6.6.18: 8 A min-max heap is a data structure that supports both deleteMin a...
- 6.6.19: Merge the two leftist heaps in Figure 6.58.
- 6.6.20: Show the result of inserting keys 1 to 15 in order into an initiall...
- 6.6.21: Prove or disprove: A perfectly balanced tree forms if keys 1 to 2k ...
- 6.6.22: Give an example of input that generates the best leftist heap.
- 6.6.23: a. Can leftist heaps efficiently support decreaseKey?b. What change...
- 6.6.24: One way to delete nodes from a known position in a leftist heap is ...
- 6.6.25: We can perform buildHeap in linear time for leftist heaps by consid...
- 6.6.26: Merge the two skew heaps in Figure 6.58.
- 6.6.27: Show the result of inserting keys 1 to 15 in order into a skew heap
- 6.6.28: Prove or disprove: A perfectly balanced tree forms if the keys 1 to...
- 6.6.29: A skew heap of N elements can be built using the standard binary he...
- 6.6.30: Prove that a binomial tree Bk has binomial trees B0, B1, ... , Bk1 ...
- 6.6.31: Prove that a binomial tree of height k has kdnodes at depth d.
- 6.6.32: Merge the two binomial queues in Figure 6.59.
- 6.6.33: a. Show that N inserts into an initially empty binomial queue takes...
- 6.6.34: 4 Write an efficient routine to perform insert using binomial queue...
- 6.6.35: For the binomial queue:a. Modify the merge routine to terminate mer...
- 6.6.36: Suppose we extend binomial queues to allow at most two trees of the...
- 6.6.37: Suppose you have a number of boxes, each of which can hold total we...
- 6.6.38: Suppose we want to add the decreaseAllKeys() operation to the heap ...
- 6.6.39: Which of the two selection algorithms has the better time bound?
Solutions for Chapter 6: Priority Queues (Heaps)
Full solutions for Data Structures and Algorithm Analysis in Java | 3rd Edition
Very level area of the deep-ocean floor, usually lying at the foot of the continental rise.
The number of protons in the nucleus of an atom.
Two stars revolving around a common center of mass under their mutual gravitational attraction.
Tiny bits of particulate matter that serve as surfaces on which water vapor condenses.
A principle of relative dating. A rock or fault is younger than any rock (or fault) through which it cuts.
The mean temperature for a day that is determined by averaging the 24 hourly readings or, more commonly, by averaging the maximum and minimum temperatures for a day.
The location on Earth’s surface that lies directly above the focus of an earthquake.
The combined effect of evaporation and transpiration.
A cliff created by movement along a fault. It represents the exposed surface of the fault prior to modification by weathering and erosion.
The solid Earth, the largest of Earth’s four major spheres.
Large center of low pressure with an associated cold front and often a warm front. Frequently accompanied by abundant precipitation.
The escape of gases that had been dissolved in magma.
The distance at which an object would have a parallax angle of 1 second of arc (3.26 lightyears).
Metamorphism associated with large-scale mountain-building processes.
The local name given a chinook wind in southern California.
A depression produced in a region where soluble rock has been removed by groundwater.
The channel, valley floor, and sloping valley walls of a stream.
The conversion of a solid directly to a gas without passing through the liquid state.
Two belts of winds that blow almost constantly from easterly directions and are located on the equatorward sides of the subtropical highs.
Fog created when air moves up a slope and cools adiabatically.