111. Minimum Depth of Binary Tree
来源：互联网 发布：linux 百度云盘同步 编辑：程序博客网 时间：2024/05/20 18:17
Given a binary tree, find its minimum depth.
The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public int minDepth(TreeNode root){ if(root==null){ return 0; } if(root.left==null){ return minDepth(root.right)+1; } if(root.right==null){ return minDepth(root.left)+1; } return Math.min(minDepth(root.left),minDepth(root.right))+1; } public int run(TreeNode root) { return minDepth(root); }}阅读全文
0 0
- LeetCode 111. Minimum Depth of Binary Tree
- [LeetCode]111.Minimum Depth of Binary Tree
- 【LeetCode】111.Minimum Depth of Binary Tree
- [Leetcode] 111. Minimum Depth of Binary Tree
- 111.Minimum Depth of Binary Tree
- 111. Minimum Depth of Binary Tree
- [leetcode] 111. Minimum Depth of Binary Tree
- 111. Minimum Depth of Binary Tree
- 111. Minimum Depth of Binary Tree
- 111. Minimum Depth of Binary Tree
- 111. Minimum Depth of Binary Tree LeetCode
- 111. Minimum Depth of Binary Tree
- 111. Minimum Depth of Binary Tree
- 【LeetCode】111. Minimum Depth of Binary Tree
- 111. Minimum Depth of Binary Tree
- 111. Minimum Depth of Binary Tree
- LeetCode *** 111. Minimum Depth of Binary Tree
- 111. Minimum Depth of Binary Tree
- Linux启动管理
- vue.js学习笔记（三）--父子组件通信总结
- linux基本命令及操作2
- Zookeeper常用命令
- JS判断客户端是否是iOS或者Android手机移动端
- 111. Minimum Depth of Binary Tree
- Spring（前言）
- 使用kotlin开发springboot应用
- TensorFlow 文本识别
- 三进制小数 oj132
- CA介绍
- Leetcode--17:Letter Combinations of a Phone Number
- C primer plus（编程练习）file-4.8-5
- 官方历程 调试STM32F407 VCP例程未知设备问题
