This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Fall 11: CSci 5421Advanced Algorithms and Data Structures Out 10/31 Homework 4 Due 11/16 Please do all problems; we will grade a subset of three to four problems. Any Exercise/Problem numbers refer to the 3rd edition of the text. (Corresponding numbers for the second edition are given, where available, in parentheses.) Please follow all of the instructions given in the handout for Homework 1. 1. (12 points) Problem 12-1, p. 303304. (Problem 12-1, p. 268269.) 2. (10 points) Ex. 13.2-4, p. 314. (Ex. 13.2-4, p. 279.) A careful, well-articulated answer should be given. Pseudocode is not required. 3. (15 points) Problem 13-2, p. 332-333. (Problem 13-2, p. 295-296.) Supplement your answer with short code fragments, as appropriate. 4. (10 points) Let T be a red-black tree with n nodes, where each node has the usual fields: key, color, and pointers to its parent and children. In addition, each internal node x has an auxiliary field, diff , whose value is the difference between x s key and the minimum key in the subtree rooted...
View Full Document