Simplified Chinese version of big talk Data Structure

Updated on

3.01 P329, the second to the last line, "the height of the Left subtree of node 58 is 2," where 2 should be changed to 3. (Provided by Xiao Mo's children's shoes)

3.02 P330★In the middle section, "(that is, its left subtree height 2 minus its right subtree height 0)" should be changed to "(that is, its left subtree height 3 minus its right subtree height 1) ". Then, add a 60 node to the right of node 58, as shown in Figure 8-7-3. (Provided by Xiao Mo's children's shoes)

The following are updated in 2011-11-14.

3.03 P194, 3rd in the middle, "7th ~ Eight rows, whild (p! = T) ", where" whild "should be changed to" while ". (Provided by Xiao LAK)

3.04 P251 the third line "Assume N = (P, {E })..... "to" Suppose N = (V, {E })..... "(provided by Xiao LAK)

Update in 2011-11-23

In the second to last row of the third section of the 3.05 P126 page, change "0.65 million" to "65 thousand" (provided by somebodysssss)

Update in 2011-5 5 as follows

3.06 P351, the middle section, there are four m/2 segments should be between m/2 segments, see. (For you to correct the error)

Update in 2011-7 7 below

3.07 P288, the second row of the second section, "the cross linked list is an upgrade of the adjacent matrix, while the multiple adjacent tables are the upgrade of the adjacent table .", It should be changed to "the cross linked list is used to optimize the structure of the directed graph adjacent table, and the multiple adjacent tables are used to optimize the structure of the undirected graph adjacent table ." (Provided by Wei Huan)

Update in 2011-12-20

3.08 (this change is only printed for the third time) P61, the third line of code, "if (! P | j> = I) ", remove" =. P63, a line in the middle of the Code, "if (! P | j> = I) ", remove" =. P65, one line in the middle of the Code, "if (! P | j> = I) ", remove" =. (Provided by kenly2007)

The following updated on

3.09 in the last row of P68, "the pointer field of the linked list should be left blank", and the "linked list" should be changed to "Node ". (Provided by fallen Cliff)

3.10 P138 bottom formula, "And 'p1 ...... K-1 ', a "p" missing on the left side of the "K-1)

The following are updated on.

3.11 In the last sentence of the penultimate row of P108, "it is a right brace or the priority is lower than", where "lower" is changed to "not higher ". (Provided by Wang tianxing)

3.12 two problems in the source code stack and DoubleStack. c of the queue (currently the source code has been fixed, and you can download it again. There are no errors in the book ):

Question 1:
Int StackLength (SqDoubleStack S)
{
Return (S. top1 + 1) + (MAXSIZE-1-S.top2 );
}
The statement return (S. top1 + 1) + (MAXSIZE-1-S.top2); should be modified to return (S. top1 + 1) + (MAXSIZE-S.top2 );

Question 2:
Status StackTraverse (SqDoubleStack S)
{
Int I;
I = 0;
While (I <= S. top1)
{
Visit (S. data [I ++]);
}
I = S. top2;
While (I <MAXSIZE)
{
Visit (S. data [I ++]);
}
Printf ("\ n ");
Return OK;
}
The statement while (I <S. top1) in should be modified to while (I <= S. top1) (provided by Yunfeng)

The following updated on

2.19★P157, The firstchild of the first row of data in Table 6-4-3 should be 1 rather than-1. (Provided by Xiao Lak, secondary printing has been inspected but not updated)

3.14 P234 figure 7-4-10 in the lower-right corner of the sentence "V2 and no V0 edge vertex, so its taillink is blank" taillink should be headlink (provided by Fengjie monthly)

Updated in May 23

2.05★★P58, Figure 3-6-4 and figure 3-6-6. In the two figures, change "header Pointer" to "next pointer address ". Figure 3-6-6, "0900" should be changed to "NULL" (provided by Xiao Lak, secondary printing has been incorrect but not updated)

Below are the shortcomings of the fourth Printing

The following updated on

4.01 P188, the second paragraph is deleted, that is, "of course, you can also ...... ### DB # CA "section. The reason is that, because the root node cannot be created in the Middle-order traversal, it is impossible to create a binary tree by adding "#". The latter-order traversal can be seen in the following section under specific rules. (Provided by CAT □mi and G-rated)

Updated in May 14

2.42★P216, in Figure 7-2-6, vertex B and vertex D lack two reverse links. Because the definition of a complete graph is that any two vertices have two arcs in the opposite direction.

The following updated on

4.02 P52, line 8th of code, "if (I <1 | I> L-> length + 1)", "+ 1" is not required, it should be "if (I <1 | I> L-> length )". (Provided by csensix) there is no need to modify this part and there is no error, for more information, see the source code comment "/* When I is smaller than the first or later position */"

The following updated on May 25

P70, Figure 3-11-1, the last time performance, should be changed to "find" (provided by Darker)

Update the following on May 16

P261★★Line 2 of the code "(* P) [v] = 0/* the initialization path array P is 0 */". Change 0 to-1, that is, "(* P) [v] =-1/* the initialization path array P is-1 */". This is because when the value is 0, it indicates that there is no path, but it is coincident with the number of the array index 0. In some special cases, the shortest path calculation error occurs, the downloaded code and test code are also modified. Download and view the code. (Provided by Wu fan zi)

Updated in the following

P103, figure 4-8-3, in which Fib is changed to Fbi. This error is not serious. Do not change it. Because it is short for the word "Fibonacci", both the Fbi and Fib can be used. In order to be consistent with the code, we recommend that such minor errors will be corrected in subsequent printed versions. (Provided by hefeijuan)