The George Washington University
School of Engineering and Applied Science
Department of Electrical Engineering and Computer Science

CSci 131 - Data Structures
Week 12 Homework

1. Complete the priority queue segment of the Interactive Data Structure Visualization courseware and submit the problem electronically.

2. Complete the height-balanced trees segment of the Interactive Data Structure Visualization courseware and submit the problem electronically.

3. Complete the tree categorization segment of the Interactive Data Structure Visualization courseware and submit the problem electronically.

4. Give an example of a binary tree that is height balanced-2, but is not an AVL tree.

5. What are the most important characteristics of any hash function? Explain why collisions occur in hash tables and describe the effect they have on the efficiency of searching these tables.