I need help implementing the following

. BTree(); //Constructor: Creates an empty tree . ~BTree(); //Destructor: Deallocates memory . void insert(Type data); //Inserts a node into the tree . void preOrder(); //Displays a pre-order traversal of the tree . void inOrder(); //Displays an in-order traversal of the tree . void postOrder(); //Displays a post-order traversal of the tree . int nodeCount(); //Calculates the number of items in the tree . Node*find (Type item); //Returns a node that contains the given value . Node*findRightMostNode(Node *find);//Given the *find node, it traverses the tree to find the right most node from that branch. . void remove(Type item);//Removes the node from the tree