BST code

Completion of BST class Modify the code in BST.h to complete the class BST by providing the following methods copy constructor destructor assignment operator method apply() with prototype void apply(void f(DataType & item)); that will do a preorder traversal of the tree and call f() on the data item at each node. Note that the function passed to the parameter f() can be any function that acts on a single tree item. It can display an item, change its value, or, with the aid of global or class variables, do things like sum the values at all nodes. A similar approach is used by many of the algorithms in STL. You provide a function and they use it on the items in the collection. Test your class with the program BSTTest.cpp. FILES ARE ATTACHED

## Deliverables

1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased.

## Platform

microsoft visual studio Must be 100% finished and received by buyer on: Dec 10, 2002 The test file needs to be modified to work with visual studio 6, it was written in g++

## Deadline information

The test file needs to be modified to work with visual studio 6, it was written in g++

Програмування на С Техніка MySQL PHP Архітектура ПЗ Тестування ПЗ

ID Проекту: #2890860

Про проект