make this using c++ make separate functions for that

Code the Following for the Binary Search Tree (BST): Make a Menu like below, which will ask the choice of the User. There must be few nodes in the tree before the following Menu appears. There must be a separate function for each of the Following. 1. Insertion in BST. 2. Deletion from BST 3. Finding a Value. 4. Find Minimum 5. Find Maximum. 6. Traversing. a. In-order b. Pre-order. C. Post-order. d. Breadth-First Search