Binary Search Tree

Write a program that does the following: It develops a binary search tree, each node having variables char letter; int n; left *node; right *node; root is a pointer to node in class tree that you will use. Assume the BST [binary search tree] is ordered with respect to the letters in its nodes and n in any node is a 2-digit id number of the letter in the node, 0< n <20 . Assign a distinct id number for each letter. [1] Insert 12 distinct letters in the tree. Output all letters with their id n. [2] Generate a random number n such that 0 < n < 20 and delete it from the tree if it exists and print out the value of the letter and n while deleting it. Also, after a node is deleted, print the values of letters and their id’s, which are still in BST. [3] Repeat step [2] until the BST becomes empty. ## 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 Unix/VC++