In C++, ### Binary Tree Single Parent Function**Objective:** Create a function called `singleParent` that calculates the number of nodes in a binary tree which have exactly one child.**Instructions:**1. **Function Creation:** - Implement the `singleParent` function to traverse a binary tree. - The function should return the count of nodes that have only one child.2. **Integration:** - Integrate the `singleParent` function into the existing `binaryTreeType` class.3. **Testing:** - Develop a program that initializes a binary search tree. - Utilize the program to test the `singleParent` function for accuracy.**Note:** Begin the process by constructing a binary search tree.

Give a C++ Program that will have, singleParent, which returns the number of nodes in a binary tree that has only one child. Add this function to the class binaryTreeType and create a program to test this function.C++ Program: #include<iostream>#include <queue> using namespace std; // Node of Each Tree struct node{ int data; node *left; node *right;}; //Create New Node of Each tree node *newNode(int item){ node *temp = new node; temp->data = item; temp->left = NULL; temp->right = NULL; return temp;} //Inorder Traversal of Tree void inorder(node *root){ if (root != NULL) { inorder(root->left); printf("%d ", root->data); inorder(root->right); }} //Insertion Of Binary search Treenode* binarySearchTree(node* head, int data){ if (head == NULL) return newNode(data); if (data < head->data) head->left = binarySearchTree(head->left, data); else if (data > head->data) head->right = binarySearchTree(head->right, data); return head;} //Calculate Height of Treeint height(node* root){ if (root == NULL) return 0; else { int l = height(root->left); int r = height(root->right); return max(l, r) + 1; }} // Caluclate Single Parents of Binary Search Tree int singleParent(node *root) { queue<node*> qp; int ans = 0; if (root == NULL) { return 0; } qp.push(root); while (!qp.empty()) { node *f = qp.front(); qp.pop(); if ((f->left != NULL && f->right == NULL) || (f->right != NULL && f->left == NULL)) { ans++; } if (f->left != NULL) { qp.push(f->left); } if (f->right != NULL) { qp.push(f->right); } } return ans;} int main() { node *root = NULL; cout << "Enter The Elements Ending with -1" << endl; int d; cin >> d; while (d != -1) { root = binarySearchTree(root, d); cin >> d; } cout << "The tree elements in Inorder: "; inorder(root); cout << "\nThe tree height: "; cout << height(root) << endl; cout << "The number of single parents: "; cout << singleParent(root) << endl; return 0; } Output: