[leetcode] 111. Minimum Depth of Binary Tree
来源：互联网 发布：淘宝卖家子账户怎么用 编辑：程序博客网 时间：2024/05/22 06:08
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.
解法：
recursive function.
/** * 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 {public: int minDepth(TreeNode* root) { if (!root) return 0; if (!root->left && !root->right) return 1; if (!root->left) return minDepth(root->right) + 1; else if (!root->right) return minDepth(root->left) + 1; else return 1+min(minDepth(root->left),minDepth(root->right)); }}; 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
- asp.net MVC实现Fullcalendar增删改的功能遇到的问题（包括datetimepicker冲突）
- C语言的关键字用法
- tcpdump抓包规则常用命令
- js验证邮箱，手机号码是否合法
- 超大整数相加用字符串解决
- [leetcode] 111. Minimum Depth of Binary Tree
- LeetCode Jump Game II
- Hbase基本概念
- POJ3461 Oulipo KMP基础
- 你是一个姑娘，所以你更需要努力(摘)
- Prison Break
- pc-lint使用
- Codeforces Beta Round #2
- 程序员编程艺术：第九章、闲话链表追赶问题
