COP 3530			EXAM 2			February 25, 1998

Kraynek							Name:_______________

15 points
1. Consider the following binary tree:


a. List the nodes in preorder



b. List the nodes in inorder



c. List the nodes in postorder

5 points
2. Show the resulting binary tree after the node A is deleted from the tree of problem 1 using the delete algorithm given in class.

15 points
3. Write the method public void insert(TeamInfo aTeam) from Assignment Three. If a helper method is used include it also.


10 points
4. Write a method for a Binary Search Tree of TeamInfo nodes that deletes the largest (alphabetically) team from the tree. Use the declaration public void deleteMax();


5 points
5. What is the running time of the algorithm that traverses a binary tree in inorder? Why?