Error list, Second Printing Page 108: Change .328 to 1.328. Page 252: In Exercise 7.19(b), change "nondistinct" to "distinct". Page 505: For entry Sheng, X., change 494 to 495. Page 506: For entry Stringling's formula, change 252 to 253. Error list, First Printing These errors were fixed in the second printing. Page 78: In next to last paragraph, change "since QFront is now 10" to "QRear is now 10" Page 111: Some pictures were slightly clipped. Page 146: Devroye is misspelled in reference 14. Page 457: The sentence that begins "Nodes with only a left child" is wrong. Switch the first occurrence of "left" and "right" Page 461: The picture is slightly clipped. Page 467: The picture is slightly clipped. Page 472: In four places, replace "leaf" with "level one node". This occurs at the end of paragraph #1(the word "node" is not needed here), the end of paragraph #2, and twice in paragraph #3. Page 491: In exercise 12.17, replace "by" with "without". ---------------------------------------------------- Errors in the Second Printing LAST UPDATE: March 23, 1997 Page 76: The description of activation records should mention that in practice, the current state is stored at the top of the stack. Page 145: In reference 6, McCreight's name is misspelled. Page 227: To preserve stability, the first test in the first while loop should be if A[ LPos ] <= A[ RPos ] then Also, i must be declared and NumElements must be initialzed to RightEnd - LPos + 1 Page 249: In Figure 7.18, change 75 to 15 everywhere. Page 308: In paragraph two, "it is spanning because it covers every vertex" Page 309: At the end of paragraph 3 in Section 9.5.1, it should be d_w = min( d_w, c_{v,w} ). Page 347: In the largest paragraph, "Then 011 follows, giving an s." Page 458: In the second line of Figure 12.15, replace "examing" with "examining" Page 470: In Figure 12.33, the link from node 40 to 45 should be from node 50 to 45. Page 473: The code has a bug in the if statement for step 3. The second test is (T^.Right^.Level < T^.Level - 1)