leetcode | Minimum Depth of Binary Tree
来源：互联网 发布：网络证券交易业务模式 编辑：程序博客网 时间：2024/05/16 10:38
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; else if(root.left==null&&root.right==null) return 1; else if (root.left==null) return 1+minDepth(root.right); else if (root.right==null) return 1+minDepth(root.left); int l = minDepth(root.left); int r = minDepth(root.right); return l>r?r+1:l+1; }} 0 0
- LeetCode: Minimum Depth of Binary Tree
- [Leetcode] Minimum Depth of Binary Tree
- LeetCode : Minimum Depth of Binary Tree
- leetcode 31: Minimum Depth of Binary Tree
- [LeetCode] Minimum Depth of Binary Tree - BFS
- [LeetCode] Minimum Depth of Binary Tree - DFS
- 【leetcode】Minimum Depth of Binary Tree
- LeetCode：Minimum Depth of Binary Tree
- [LeetCode]Minimum Depth of Binary Tree
- [Leetcode]Minimum Depth of Binary Tree
- [leetcode]Minimum Depth of Binary Tree
- Leetcode: Minimum Depth of Binary Tree
- LeetCode-Minimum Depth of Binary Tree
- [leetcode] Minimum Depth of Binary Tree
- LeetCode - Minimum Depth of Binary Tree
- 【Leetcode】Minimum Depth of Binary Tree
- LeetCode | Minimum Depth of Binary Tree
- LeetCode - Minimum Depth of Binary Tree
- 面试70问 经典回答
- Fragment如何调用所在Activity的dispatchTouchEvent(MotionEvent ev)函数
- 第七周-项目4-队列数组
- POJ 1163 The Triangle DP
- php函数
- leetcode | Minimum Depth of Binary Tree
- which xlog fsync method support O_DIRECT bypasses the kernel buffers
- VLD(Visual LeakDetector)内存泄露库的使用
- android源码分析--MMS--ComposeMessageActivity
- 【linux】linux常用命令详解
- javascript继承
- 华为、腾讯校招面试总结
- 绑定服务并调用服务中的方法
- php函数
