Binary Tree Search

Write in C++ on this project Add the following member functions to the Binary Search Tree (BST) template class: getNodeCount(): Returns the number of nodes in the tree. getLeafCount(): Returns the number of leaf nodes in the tree. getTreeHeight(): Returns the height of the tree. The height of the tree is the number of levels it contains. For example, the tree on page 1076 of the textbook has three levels. So its height is 3. Write the main function as follows: Create an object of the BST class for integers. Open a text file named tree.txt. This file contains integers separated by a blank, a tab, or a newline. We don't know in advance how many integers are in the file. For example, the file may look like (for simplicity, you can assume that all numbers are unique): 20 45 1 3 1000 35 2 101 299 17 5 Read integers from the file and insert them into the BST object. When reading is done, close the file. [OUTPUT] Print the contents of the BST object on the screen using in order traversal, one number per line. [OUTPUT] By calling the 3 member functions you added to the BST class, display the number of nodes, the number of leaf nodes, and the height of the tree on the screen with proper messages. ## Deliverables Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Complete copyrights to all work purchased. ## Platform I use Visual C++ 6.0 compiler to run this program ## Deadline information Please deliver codes on time, due date 4/27/2002