Q1 ) write a c++ program to implement const; bool search(const elem Type & searchltem) if(current->info == insertitem) { to seach for an element in the tree and return true if that element was found or fasle if not found in the tree based the bellow class binary Tree Type: : #include cout return; using namespace std; } template else if(current->info > insertitem) struct binary TreeNode { current = current->llink; elem Type info; else binary TreeNode *llink; current = current->rlink; binary TreeNode *rlink; }llend while 1/Definition of the class if(trailCurrent->info > insertitem) template trailCurrent->llink = newNode; class binary Tree Type else { trailCurrent->rlink = newNode; public: } }llend insert bool isEmpty() const;//Returns true if the binary tree is empty;//otherwise, returns false. void inorder Traversal() const;//Function to do an inorder traversal of the binary tree. void preorder Traversal() const;//Function to do a preorder traversal of the binary tree. template bool binary TreeType::search(const elemType& searchltem) const void postorderTraversal() const;//Function to do a postorder traversal of the binary tree. int treeHeight() const;//Returns the height of the binary tree. { int treeNodeCount() const;//Returns the number of nodes in the binary tree. int treeLeavesCount() const;//Returns the number of leaves in the binary tree. }llend search