Find height of a binary tree.cpp

// number edges in longest path
// depth and height are different properties
struct Node
{
    int data;
    struct Node *left;
    struct Node *right;
}

int FindHeight(struct Node *root)
{
    if (root == NULL)
    {
        return -1;
    }
    return max(FindHeight(root->left), FindHeight(root->right)) + 1;
}