deepest leaf cpp

// Program to print the deepest leaf node in the binary tree using inorder traversal
#include <iostream>

using namespace std;

// node class
class node{
public:
    int data;
    int hd;
    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->hd = -1;
    temp->left = NULL;
    temp->right = NULL;
    return temp;
}

// function to print the deepest leaf node in the binary tree using inorder traversal
void deepest_level_leaf_node(node* root, int *max_level, int *answer, int level = 0){
    // if the tree is empty or if we reach a leaf node then return 0
    if (root == NULL){
        return;
    }
    // check in the left subtree for the element
    // if found then return the level
    deepest_level_leaf_node(root->left, max_level, answer, level + 1);
    if(root->left == NULL && root->right == NULL && *max_level < level){
        *max_level = max(*max_level, level);
        *answer = root->data;
    }
    deepest_level_leaf_node(root->right, max_level, answer, level + 1);
}

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);
    int max_level = INT8_MIN;
    int deepest_leaf = INT8_MIN;
    deepest_level_leaf_node(head, &max_level, &deepest_leaf);
    cout<<"Deepest Level leaf node in the above binary tree is : "<<deepest_leaf<<endl;

}



/*

Deepest Level leaf node in the above binary tree is : 10
Process finished with exit code 0

*/