题目地址(111. 二叉树的最小深度 - 力扣(LeetCode))
https://leetcode.cn/problems/minimum-depth-of-binary-tree/description/
大约 2 分钟
https://leetcode.cn/problems/minimum-depth-of-binary-tree/description/
https://leetcode.cn/problems/binary-tree-right-side-view/description/
https://leetcode.cn/problems/n-ary-tree-level-order-traversal/description/
https://leetcode.cn/problems/find-largest-value-in-each-tree-row/description/