LeetCode: Minimum Depth of Binary Tree

LeetCode: Minimum Depth of Binary Tree

LeetCode: Minimum Depth of Binary Tree

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.

地址：https://oj.leetcode.com/problems/minimum-depth-of-binary-tree/

算法：递归，看代码：

 1 /**
 2  * Definition for binary tree
 3  * struct TreeNode {
 4  *     int val;
 5  *     TreeNode *left;
 6  *     TreeNode *right;
 7  *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 8  * };
 9  */
10 class Solution {
11 public:
12     int minDepth(TreeNode *root) {
13         if(!root){
14             return 0;
15         }
16         return subMinDepth(root);
17     }
18     int subMinDepth(TreeNode *root){
19         if(!root->left && !root->right){
20             return 1;
21         }
22         int left = 0x7FFFFFFF;
23         int right = 0x7FFFFFFF;
24         if(root->left){
25             left = subMinDepth(root->left);
26         }
27         if(root->right){
28             right = subMinDepth(root->right);
29         }
30         return left > right ? right + 1 : left + 1;
31     }
32 };

 

posted on 2014-08-26 22:40 Boostable 阅读( ...) 评论( ...) 编辑 收藏

转载于:https://www.cnblogs.com/boostable/p/leetcode_minimum_depth_of_binary_tree.html