下面函数用于计算二叉树的高度,横线处应填写( )。
int height(TreeNode *root) { if (root == nullptr) return 0; int leftH = height(root->left); int rightH = height(root->right); return __________________________; }
leftH + rightH
min(leftH, rightH) + 1
max(leftH, rightH)
max(leftH, rightH) + 1