Binary Search Trees Chapter 19

More documents

Recommendations

Info

Figure <strong>19</strong>.36If S is black, a double rotation involving X, the parent, and the grandparent, withappropriate color changes, restores property 3 if X is an inside grandchild.Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley
Figure <strong>19</strong>.37If S is red, a single rotation between parent and grandparent, with appropriate colorchanges, restores property 3 between X and P.Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley
Page 1 and 2: Chapter 19(continued)Binary Search
Page 3 and 4: Figure 19.2Binary search trees (a)
Page 5 and 6: Figure 19.4Deletion of node 2 with
Page 7 and 8: Figure 19.19(a) The balanced tree h
Page 9 and 10: Figure 19.21Two binary search trees
Page 11 and 12: Figure 19.23Single rotation to fix
Page 13 and 14: Figure 19.26Symmetric single rotati
Page 15 and 16: Figure 19.29Left-right double rotat
Page 17 and 18: Figure 19.31Right-Left double rotat
Page 19: Figure 19.35If S is black, a single

Binary Search Trees Chapter 19

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?