Height of binary tree

height.cpp

int height(node* root) {
    if (!root) return 0;
    int leftHeight = 0, rightHeight = 0;
    if (root->left)
        leftHeight = 1 + height(root->left);
    if (root->right)
        rightHeight = 1 + height(root->right);
    return max(leftHeight, rightHeight);
}