Binary Search tree in C++

This program is to implement the binary-search-tree(BST)operation in C++. search, insert, and delete. Note that no rebalancing is to be done. you may assuem the elements in the tree are of type integer. in addition, write a function to print the elements of abinary tree in preorder(prefix). For ease of reading, use parenthesis around each subtree. (when a call is made to print a tree or a subtree print a "(" at the beginning and a ")" at the end.) perform the following operations from the main program. After eash insert or delete operation, print the operation in one line and the resulting tree on the next line. -create an empty array -insert some integer numbers such as 50 75 25 ...(with error handeling, Already in tree) -delete some numbers (with error handeling, not found). ## 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 win 2000, borland 5.5, C++ ## Deadline information must be completed by 10/20/02