Site MapHelpFeedbackBinary Search Trees
Binary Search Trees


CHAPTER OBJECTIVES

1. Compare the time efficiency of the BinarySearchTree class’s insertion, removal, and search methods to that of the corresponding methods in the ArrayList and LinkedList classes.
2. Discuss the similarities and differences of the BinarySearchTree class’s contains method and the binarySearch methods in the Arrays and Collections classes.
3. Explain why the BinarySearchTree class’s remove method and the TreeIterator class’s next method are somewhat difficult to define.
4. Be able to perform each of the four possible rotations.
5. Understand why the height of an AVL tree is always logarithmic in n.







To learn more about the book this website supports, please visit its Information Center.
(c)2005 McGraw-Hill Higher Education
Any use is subject to the Terms of Use and Privacy Policy.
McGraw-Hill Higher Education is one of the many fine businesses of The McGraw-Hill Companies.


CollinsOnline Learning Center

Home > Chapter 10