diameter bt cpp

// program to find the diameter of a given binary tree

#include <iostream>
#include <queue>
#include <map>

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 the height of a binary tree
int height(node* root){
    if (root == NULL){
        return 0;
    }
    return (1 + max(height(root->left), height(root->right)));
}

int diameter(node* root){
    if (root == NULL){
        return 0;
    }

    int left_height = height(root->left);
    int right_height = height(root->right);

    int left_diameter = diameter(root->left);
    int right_diameter = diameter(root->right);

    return max( left_height + right_height + 1 , max(left_diameter, right_diameter) );
}



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<<"Diameter of the Above binary tree is : "<<diameter(head);

}

/*

Diameter of the Above binary tree is : 10
Process finished with exit code 0

*/