forked from ManishGupta1908/LeetCode-with-JavaScript
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathres.ts
29 lines (26 loc) · 737 Bytes
/
res.ts
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
/**
* Definition for a binary tree node.
*/
class TreeNode {
val: number
left: TreeNode | null
right: TreeNode | null
constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
this.val = (val===undefined ? 0 : val)
this.left = (left===undefined ? null : left)
this.right = (right===undefined ? null : right)
}
}
function minDepth(root: TreeNode | null): number {
if (!root) {
return 0;
}
if (!root.left && !root.right) {
return 1;
}
if (root.left && root.right) {
return Math.min(minDepth(root.left), minDepth((root.right))) + 1;
} else {
return Math.max(minDepth(root.left), minDepth((root.right))) + 1;
}
};