leetcode 111: Minimum Depth of Binary Tree
来源：互联网 发布：python计算机视觉编程 编辑：程序博客网 时间：2024/05/22 13:09
/** * 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->right) return minDepth(root->left)+1; if(!root->left) return minDepth(root->right)+1; return min(minDepth(root->left),minDepth(root->right))+1; }}; 0 0
- 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-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
- 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
- c 语言指针学习
- [UVA 12589]Learning Vector[DP]
- 操作基本像素
- IOS--cell不出图解决方法
- POJ 2349 Arctic Network 最小生成树 prim && kruscal
- leetcode 111: Minimum Depth of Binary Tree
- 母港TOP用新API_url = "api_port/port";20150803_破解版
- 2.4 1的数目
- GDB使用
- HDOJ--1162--Eddy's picture(包含题意)
- 算法学习之排序算法（一）（冒泡法）
- JDK各个版本的新特性
- 读书笔记-APUE第三版-(11)线程
- clink and ConEmu
