GFG PTOD | 04 Feb | Diameter of a Binary Tree | Medium level | Tree

int height(Node* node, int &dia) {
        // code here
        if(node == NULL) return 0;
        int lh = height(node->left,dia);
        int rh = height(node->right,dia);
        dia = max(dia, lh+rh);
        return max(lh, rh) +1;
    }
    int diameter(Node* root) {
        // Your code here
        int diameter = 0;
        height(root, diameter);
        return diameter;
    }