leetcode-Minimum Depth of Binary Tree
来源：互联网 发布：cf网络异常重新登录 编辑：程序博客网 时间：2024/05/16 07:19
Difficulty: Easy
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. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution { int helper(TreeNode *root){ if(!root->left&&!root->right) return 1; int left=INT_MAX; if(root->left) left=helper(root->left); int right=INT_MAX; if(root->right) right=helper(root->right); return min(left,right)+1; }public: int minDepth(TreeNode* root) { if(!root) return 0; return helper(root); }}; 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
- READING NOTE: Joint Tracking and Segmentation of Multiple Targets
- VMware11安装OSX10.10虚拟机
- Java性能调优
- 电磁波的传播
- Struts2+ajax之form表单提交实例
- leetcode-Minimum Depth of Binary Tree
- win7 32bit python2.7 python manage.py syncdb -> No module named MySQLdb
- Ubuntu解压缩zip,tar,tar.gz,tar.bz2
- 约瑟夫环问题
- salt key用法
- leetocde-Maximum Depth of Binary Tree
- 抽取出的BaseService,以及实现类中调用的原理
- Linux进程间套接字（Socket）通信
- ActiveMQ 使用场景
