1
2
3
4
5
6
7
8
9
10
11
12
13
import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
export default function minDepth(root: TreeNode | null): number {    if (root == null) return 0;    const m1 = minDepth(root.left);    const m2 = minDepth(root.right);    //1.如果左孩子和右孩子有为空的情况，直接返回m1+m2+1    //2.如果都不为空，返回较小深度+1    return root.left == null || root.right == null        ? m1 + m2 + 1        : Math.min(m1, m2) + 1;}