LeetCode--Minimum Depth of Binary Tree
来源：互联网 发布：淘宝评论打不开 编辑：程序博客网 时间：2024/05/01 06:10
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 binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: int minDepth(TreeNode *root) { if(root == NULL) return 0; int l = minDepth(root->left); int r = minDepth(root->right); if(l==0) return r+1; if(r==0) return l+1; return l>r ? (r+1):(l+1); }}; 2 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
- java.lang.OutOfMemoryError: PermGen space及其解决方法
- No configuration found for the specified action解决办法
- mysql 动态按季度创建表
- BZOJ 2813 奇妙的Fibonacci 线性筛
- Day7-文本编辑之输入图像
- LeetCode--Minimum Depth of Binary Tree
- SpringMVC返回JSON格式
- android:versionCode 不是点.
- 调查称过半新加坡年轻女性上传照片前会先修图
- 合并两列为一列
- 静电释放的危险
- 实验五： 树和二叉树实验
- linux shell编程 数组
- jquery积累
