1. Draw the BST that results when the words are inserted in the order given below.

using, while, static, private, enum, case, return, public < 8 >

2. Given the preorder and inorder traversals of a binary tree, you build that binary tree.

< 8 >

Preorder: X B G Y D E C N

Inorder: Y G B D X E C N

3. (a) Under what type of data arrangement; Quick sort works at its worst efficiency?

< 2>

___________________________________________

(c) When do you use external sorts?

< 2 >

4. Show the various splitting and merging stages of Binary merge sort for the following list of numbers. < 8 >

8 21 13 35 16 10 48 32