Implement the following 1. preorder traversal 2. postorder traversal 3. modification to Test so that tree can be manually traversed via a cursor such that user commands do as follows - reset, cursor points to root, and prints root - left, cursor points left of cursor, and prints cursor - right, cursor points right of cursor, and prints cursor 4. Traverse the tree and compute - the average height of nodes - median height of nodes 5. Perform a set of experiments to measure the height of the tree, mean and median height for random data sets of diffeent sizes. The data sets should be produced via random sampling of the dictionary.txt 6. A traversal that counts the number of nodes in the tree (to confirm size) 7. An iterative implementation of preorder and inorder using a stack 8. Modify the code for iterative preorder to use a queue and then explain the traversal 9. Write a Caley notation save and load function Patrick Prosser September 2010 (1 to 6) December 2010 (7 to 9)