1,题目要求,求一个二叉树的最小深度?
int minHeight(TreeNode* root) {
if(NULL == root) return 0;
int left = minHeight(root->left);
int right minHeight(root->right);
if(left == 0 && right == 0) {
return 1;
}
if(left == 0)
left = INT_MAX;
if(right == 0)
right = INT_MAX;
return 1 + (left > right) ? right : left;
}