print leafs bt cpp

// program to print leaf nodes in a binary tree
#include <iostream>

using namespace std;

// node class
class node{
public:
    int data;
    node* left;
    node* right;
};

// function that returns a pointer to new node
node* createNode(int element){
    node* temp = (node*) malloc(sizeof(node));
    temp->data = element;
    temp->left = NULL;
    temp->right = NULL;
    return temp;
}

// function to print all leaf nodes in a tree using inorder traversal
void print_leaves(node* root){
    if (root != NULL){
        print_leaves(root->left);
        if(root->left == NULL && root->right == NULL){
            cout<<root->data<<" ";
        }
        print_leaves(root->right);
    }
}

int main() {
    node* head = createNode(1);
    head->left = createNode(2);
    head->right = createNode(3);
    head->left->left = createNode(4);
    head->left->right = createNode(5);
    head->right->right = createNode(6);
    head->left->left->right = createNode(7);
    head->right->right->left = createNode(8);
    head->left->left->right->left = createNode(9);
    head->left->left->right->left->left = createNode(10);
    head->right->right->left->right = createNode(11);

    cout<<"leaf nodes of the given tree are : "<<endl;
    print_leaves(head);

}



/*

leaf nodes of the given tree are :
10 5 11
Process finished with exit code 0

*/