C++ Homework for week 3
For this homework you have to implement a
binary search tree. Each node of your binary search tree should store a float
element value as well a left and right pointer.
A good place to start is the
implementation in your text found in figure 6.8. This week implement some of the
most basic functions, that is insert, search, and the recursive traversals,
preorder, inorder,
postorder.
To test the workings
of your binary tree generate a sequence of random values k, with 0 < k <
1, and insert them into the tree. Then use the traversals , preorder, inorder,
postorder, to print the key values in your test tree. You may also want to test
some of the functions in your answers to this week's Data Structures
questions.
Posted: Thu - January 18, 2007 at 10:11 AM