level node bt cpp

// program to find level of a node 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 find and return the level of a node in binary tree
int level_of_node(node* root, int data, int level = -1){
    // if the tree is empty or if we reach a leaf node then return 0
    if (root == NULL){
        return -1;
    }
    if(root->data == data){
        return level+1;
    }

    // check in the left subtree for the element
    // if found then return the level
    int level_node = level_of_node(root->left, data, level + 1);
    if (level_node != -1){
        return level_node;
    }

    // searching for the node in right subtree
    level_node = level_of_node(root->right, data, level + 1);
    return level_node;

}


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<<"Level of node 1 is : "<<level_of_node(head, 1)<<endl;
    cout<<"Level of node 5 is : "<<level_of_node(head, 5)<<endl;
    cout<<"Level of node 10 is : "<<level_of_node(head, 10)<<endl;
    cout<<"Level of node 7 is : "<<level_of_node(head, 7)<<endl;
    cout<<"Level of node 24 is : "<<level_of_node(head, 24)<<endl;


}



/*

Level of node 1 is : 0
Level of node 5 is : 2
Level of node 10 is : 5
Level of node 7 is : 3
Level of node 24 is : -1

Process finished with exit code 0

*/