https://leetcode.com/problems/minimum-depth-of-binary-tree/

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
/**
* Definition for a binary tree node.
* function TreeNode(val) {
* this.val = val;
* this.left = this.right = null;
* }
*/
/**
* @param {TreeNode} root
* @return {number}
*/
var minDepth = function(root) {
if (!root) {
return 0
}
if (!root.left || !root.right) {
return minDepth(root.left) + minDepth(root.right) + 1
}
return Math.min(minDepth(root.left), minDepth(root.right)) + 1
};