C++ program to print all full nodes in a binary tree
Description:
This Program is to print all full nodes in a binary tree
For Example:
Input :
The Elements are : 1 ,2 ,3 ,4 ,5 ,6 ,7
1
/ \
2 3
/ \ / \
4 5 6 7
Output :
2 1 3
Program :
//C++ program to print all full nodes in a binary tree
using namespace std;
// tree node
struct Node
{
int data;
Node *left, *right;
};
// returns a new tree Node
Node* newNode(int data)
{
Node* temp = new Node();
temp->data = data;
temp->left = temp->right = NULL;
return temp;
}
//print all full nodes having both left and right node
void FullNodes(Node *root)
{
if (root != NULL)
{
FullNodes(root->left);
if (root->left != NULL && root->right != NULL)
cout << root->data << " ";
FullNodes(root->right);
}
}
int main()
{
struct Node *root = newNode(1);
root->left = newNode(2);
root->right = newNode(3);
root->left->left = newNode(4);
root->left->right = newNode(5);
root->right->left = newNode(6);
root->right->right = newNode(7);
FullNodes(root);
return 0;
}
Comments