[Leetcode] Minimum Depth of Binary Tree
来源：互联网 发布：python re 非贪婪匹配 编辑：程序博客网 时间：2024/05/01 18:00
/** * 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) { // Start typing your C/C++ solution below // DO NOT write int main() function if (root == NULL) return 0; else if (!root->left && !root->right) return 1; int left = INT_MAX; int right = INT_MAX; if (root->left) left = minDepth(root->left); if (root->right) right = minDepth(root->right); return min(left, right) + 1; }};- 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
- ORA-16019
- [Leetcode] Maximum Subarray
- 20.Java序列化【草案二】
- Java中文乱码相关问题深入剖析
- NYOJ 306 走迷宫 【二分+搜索】
- [Leetcode] Minimum Depth of Binary Tree
- UML之三——状态图
- Android开发4——文件操作模式
- Ubuntu 12.04开机默认进入命令行模式.
- UML图之四——活动图
- [Leetcode] Maximum Depth of Binary Tree
- CentOS下安装mplayer
- UML图之五——时序图
- 将二叉树按照螺旋顺序分层连接
