please give the c++ coding of how to do the following on a binary tree(BST) using recursion:
(1) insert a new node (2) delete a node (3) search a tree
This isn't a free homework service. You're supposed to write the code yourself, and we can help you make it work. But don't expect freebies.