【leetcode】111. Minimum Depth of Binary Tree
来源：互联网 发布：淘宝华佗大药房旗舰店 编辑：程序博客网 时间：2024/05/29 03:09
题目要求：
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&&root.right==null) { return 1; } if(root.left==null) { return 1+minDepth(root.right); } if(root.right==null) { return 1+minDepth(root.left); } int leftDepth = minDepth(root.left); int rightDepth = minDepth(root.right); return 1+(leftDepth<rightDepth?leftDepth:rightDepth); }} 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
- [leetcode] 111. Minimum Depth of Binary Tree
- 111. Minimum Depth of Binary Tree LeetCode
- 【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
- 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.[Leetcode]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
- hdu2068 RPG的错排（错排公式简单应用）
- Java设计模式之——桥接模式
- 第一部分 TCP/IP基础知识
- hdu 5944 等比数列 fxx and string
- mybatis中association和collection的column传入多个参数值
- 【leetcode】111. Minimum Depth of Binary Tree
- c++模板函数
- |洛谷|并查集|P1525 关押罪犯
- POJ 3984---迷宫问题
- chromium for linux 编译
- Linux下搭建tomcat集群全记录
- notepad++运行python
- 模拟hibernate(反射+sql拼接)
- Open CV学习记录（十三）——HcVision码流
