Leetcode#111 Minimum Depth of Binary Tree
2015-02-02 11:47
447 查看
原题地址
基本二叉树遍历
代码:
基本二叉树遍历
代码:
int minDepth(TreeNode *root) { if (!root) return 0; int l = root->left ? minDepth(root->left) : 0; int r = root->right ? minDepth(root->right) : 0; return l * r > 0 ? min(l, r) + 1 : max(l, r) + 1; }
相关文章推荐
- 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: Minimum Depth of Binary Tree [111]
- 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_question_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_question_111 Minimum Depth of Binary Tree
- LeetCode#111 Minimum Depth of Binary Tree
- [leetcode-111]Minimum Depth of Binary Tree(C语言)