111. Minimum Depth of Binary Tree
Given a binary tree, find its minimum depth.
The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.
32%
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
int minDepth(struct TreeNode* root) {
int i,j;
if(!root)
return 0;
i = minDepth(root->left);
j = minDepth(root->right);
return i<j && i || !j ?i+1:j+1;
}
小鱼儿
左手的ㄟ右手
今天药忘吃喽~
分手后的思念是犯贱
怼烎@
爱被打了一巴掌
ゝ一纸荒年。
还没有评论，来说两句吧...