Height of Height of a binary tree is (1 Point) MAX( Height of left Subtree, Height of right subtree)+1 MAX( Height of left Subtree, Height of right subtree) MAX( Height of left Subtree, Height of right subtree)-1 code example

Example: height of a binary tree

int height(Node* root)
{
    // Base case: empty tree has height 0
    if (root == nullptr)
        return 0;
 
    // recur for left and right subtree and consider maximum depth
    return 1 + max(height(root->left), height(root->right));
}