/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int minDepth(TreeNode *root) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (!root) return 0;
int left = minDepth(root->left);
int right = minDepth(root->right);
if (root->left && root->right)
return min(left, right) + 1;
else
return left + right + 1;
}
};
Small Case: 8ms
Large Case: 92ms
Time: O(n)
Space: O(1)
DFS version.