Question

Write the definition of the function nodeCount that returns the number of codes in the binary tree. Add this function to the class binaryTreeType and createe a program to test this function. C++

Answer 1

`Hey,

Note: Brother in case of any queries, just comment in box I would be very happy to assist all your queries

#include<iostream>
using namespace std;
struct node
{
int key_value;
node *left;
node *right;
};
class binaryTreeType
{
public:
node *root;
binaryTreeType ();
~binaryTreeType ();
void insert(int key);
int nodeCount(node *rt);
int singleParent(node *rt);
int leafCount(node *rt);

private:
void insert(int key, node *leaf);

};
binaryTreeType ::binaryTreeType ()
{
root=NULL;
}
void binaryTreeType ::insert(int key, node *leaf)
{
if(key< leaf->key_value)
{
if(leaf->left!=NULL)
insert(key, leaf->left);
else
{
//node creation
leaf->left=new node;
leaf->left->key_value=key;
leaf->left->left=NULL;
leaf->left->right=NULL;
}
}
else if(key>=leaf->key_value)
{
if(leaf->right!=NULL)
insert(key, leaf->right);
else
{//node creation
leaf->right=new node;
leaf->right->key_value=key;
leaf->right->left=NULL;
leaf->right->right=NULL;
}
}
}
void binaryTreeType ::insert(int key)
{
if(root!=NULL)
insert(key, root);
else
{
root=new node;
root->key_value=key;
root->left=NULL;
root->right=NULL;
}
}
//below code is for our question to find the leaf count,node count and single parent node count
int binaryTreeType ::leafCount(node *rt)//count the number of leaf nodes in tree
{
if(rt == NULL)
return 0;
if(rt->left == NULL && rt->right==NULL)
return 1;
else
return leafCount(rt->left)+leafCount(rt->right);
}
binaryTreeType ::~binaryTreeType ()
{}
int binaryTreeType ::singleParent(node *rt)//count the number of single parent nodes in tree
{
if(rt==NULL)
return 0;
else
{
if (rt->left == NULL && rt->right != NULL)
return 1 + singleParent(rt->right);
else if(rt->right == NULL && rt->left != NULL)
return 1 + singleParent(rt->left);
else
return singleParent(rt->left)+singleParent(rt->right);
}
}
int binaryTreeType ::nodeCount(node *rt)//count the total nodes in tree
{
if(rt==NULL)
return 0;
else
{
return 1+nodeCount(rt->left)+nodeCount(rt->right);
}
}
int main()
{
binaryTreeType b;
//tree creation with inserting nodes
b.insert(23);
b.insert(13);
b.insert(223);
b.insert(2);
b.insert(3);
b.insert(123);
b.insert(43);
b.insert(6);
//calling the implemented functions
cout<<"number of leaf nodes in tree is\t"<< b.leafCount(b.root)<<endl;
cout<<"number of nodes in tree is\t"<< b.nodeCount(b.root)<<endl;
cout<<"number of single parent nodes in tree is\t"<< b.singleParent(b.root)<<endl;

}

Kindly revert for any queries

Thanks.