{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# hw06 - 2 Problem 6.2 on page 251-252 For part a draw the...

This preview shows page 1. Sign up to view the full content.

CSE331 Section 2 Homework 6 Due: Friday Feb. 29, 2008 at 11:59am 1. Given a height h (including leaf nodes), where 0 ≤ h ≤ ∞, and order d , a. Find the maximum number of nodes a B-tree can hold. b. Find the minimum number of nodes a B-tree can hold. Given a number of nodes n , where 0 ≤ n ≤ ∞ c. Find the maximum height (including leaf nodes) of a B-tree. d. Find the minimum height (including leaf nodes) of a B-tree.
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 2. Problem 6.2 on page 251-252. For part a, draw the resulting heap after each inser-tion. 3. Problem 6.3 on page 252. DeleteMin is the same as ExtractMin in the lectures. Draw the resulting heap after each deletion. 4. Problem 6.7 on page 253, part a and b. 5. Problem 6.8 on page 253. Show your proof....
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online