2008级计算机 据结构课堂教学笔记 内部资料,仅供课堂教学使用 e Let Fh be such a tree, with left and right subtrees FI and Fr. Then one of Fi and Fr, say FI, has height h-1 and the minimum number of nodes in such a tree, and Fr has height h-2 with the minimum number of nodes These trees, as sparse as possible for AVL trees, are called Fibonacci trees Analysis of Fibonacci Trees P. 488 Pointers and Pitfalls 6 items P515-51c Errata pp. 439, 440,"Post: lines: Change " been been"to"been"(4 occurrences p. 443, E12: Last line of code for method B needs a semicolon " " at end p. 458, line 3: insert comma at end; line 4: insert comma after"returned p. 480, Fig. 10.19, left diagram: The symbol " belongs inside the circle p. 506, Fig. 10.33(a): Both arcs at the bottom of part (a)should be labelled 1(as done in part(c)2008 级 计算机专业 数据结构 课堂教学笔记 内部资料，仅供课堂教学使用 ⚫ Let Fh be such a tree, with left and right subtrees Fl and Fr . Then one of Fl and Fr , say Fl , has height h−1 and the minimum number of nodes in such a tree, and Fr has height h−2 with the minimum number of nodes. ⚫ These trees, as sparse as possible for AVL trees, are called Fibonacci trees. Analysis of Fibonacci Trees P. 488 Pointers and Pitfalls 6 items P.515-516 ------------------------------------------------------------------------------------------------------------------------------- Errata pp. 439, 440, "Post:" lines: Change "been been" to "been" (4 occurrences). p. 443, E12: Last line of code for method B needs a semicolon ";" at end. p. 458, line 3: insert comma at end; line 4: insert comma after "returned". p. 480, Fig. 10.19, left diagram: The symbol "\" belongs inside the circle. p. 506, Fig. 10.33(a): Both arcs at the bottom of part (a) should be labelled 1 (as done in part (c)). ------------------------------------------------------------------------------------------------------------------------