Create the three following methods for a C++ Binary Search Tree:

-bool insertV(int v): Inserts v into the tree. Returns true for success and returns false if the value is already in the tree.

-bool deleteV(int v): removes the node whose value is v, deleting the node. returns true if successful, returns false if the node is not found.

-bool isIn(int v): returns true if the node with value v is in the tree. Otherwise returns false.