1. Chapter 13 Binary Search Trees

4. FIGURE 13.1 The operations on a binary search tree

5. Listing 13.1

6. Listing 13.1 (cont.)

7. FIGURE 13.2 UML description of the BinarySearchTreeADT

9. LinkedBinarySearchTree - Constructors

11. LinkedBinarySearchTree - addElement

12. LinkedBinarySearchTree - addElement

13. LinkedBinarySearchTree - addElement

14. FIGURE 13.3 Adding elements to a binary search tree

17. LinkedBinarySearchTree - removeElement

18. LinkedBinarySearchTree - removeElement

19. LinkedBinarySearchTree - removeElement

20. LinkedBinarySearchTree - replacement

21. LinkedBinarySearchTree - replacement

22. FIGURE 13.4 Removing elements from a binary tree

24. LinkedBinarySearchTree - removeAllOccurrences

26. FIGURE 13.5 Removing the minimum element from a binary search tree

28. FIGURE 13.6 The common operations on a list

29. FIGURE 13.7 The operation particular to an ordered list

30. Listing 13.2

31. Listing 13.2 (cont.)

32. Listing 13.2 (cont.)

33. Listing 13.2 (cont.)

34. FIGURE 13.8 Analysis of linked list and binary search tree implementations of an ordered list

36. FIGURE 13.9 A degenerate binary tree

41. FIGURE 13.10 Unbalanced tree and balanced tree after a right rotation

43. FIGURE 13.11 Unbalanced tree and balanced tree after a left rotation

45. FIGURE 13.12 A rightleft rotation

47. FIGURE 13.13 A leftright rotation

50. FIGURE 13.14 A right rotation in an AVL tree

53. FIGURE 13.15 A rightleft rotation in an AVL tree

56. FIGURE 13.16 Valid red/black trees

60. FIGURE 13.17 Red/black tree after insertion

63. FIGURE 13.18 Red/black tree after insertion

67. FIGURE 13.19 Red/black tree after removal

75. TABLE 13.1 Operations on a TreeSet

76. TABLE 13.2 Operations on a TreeMap