参考链接:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int minDepth(TreeNode* root) {
if(root == NULL){
return 0;
}
int dl = minDepth(root->left);
//不断迭代向下
int dr = minDepth(root->right);
//自底向上的计算高度
//当前位置高度为零,也就是底层空节点,
if(!dl){
return dr +1;
}
if(!dr){
return dl + 1;
}
return (dl>dr)?dr+1:dl+1;
}
};